/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 10:14:47,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 10:14:47,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 10:14:47,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 10:14:47,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 10:14:47,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 10:14:47,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 10:14:47,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 10:14:47,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 10:14:47,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 10:14:47,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 10:14:47,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 10:14:47,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 10:14:47,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 10:14:47,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 10:14:47,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 10:14:47,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 10:14:47,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 10:14:47,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 10:14:47,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 10:14:47,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 10:14:47,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 10:14:47,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 10:14:47,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 10:14:47,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 10:14:47,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 10:14:47,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 10:14:47,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 10:14:47,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 10:14:47,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 10:14:47,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 10:14:47,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 10:14:47,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 10:14:47,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 10:14:47,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 10:14:47,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 10:14:47,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 10:14:47,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 10:14:47,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 10:14:47,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 10:14:47,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 10:14:47,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2022-01-18 10:14:47,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 10:14:47,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 10:14:47,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 10:14:47,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 10:14:47,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 10:14:47,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 10:14:47,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 10:14:47,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 10:14:47,294 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 10:14:47,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 10:14:47,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 10:14:47,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 10:14:47,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 10:14:47,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 10:14:47,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:14:47,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 10:14:47,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 10:14:47,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 10:14:47,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 10:14:47,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 10:14:47,501 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 10:14:47,504 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 10:14:47,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-01-18 10:14:47,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cd06f45/6dc8e8237298498db1648958e870c203/FLAGcd27145db [2022-01-18 10:14:47,969 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 10:14:47,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-01-18 10:14:47,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cd06f45/6dc8e8237298498db1648958e870c203/FLAGcd27145db [2022-01-18 10:14:48,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cd06f45/6dc8e8237298498db1648958e870c203 [2022-01-18 10:14:48,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 10:14:48,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 10:14:48,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 10:14:48,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 10:14:48,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 10:14:48,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43401c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48, skipping insertion in model container [2022-01-18 10:14:48,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 10:14:48,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 10:14:48,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-01-18 10:14:48,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:14:48,388 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 10:14:48,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-01-18 10:14:48,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:14:48,472 INFO L208 MainTranslator]: Completed translation [2022-01-18 10:14:48,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48 WrapperNode [2022-01-18 10:14:48,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 10:14:48,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 10:14:48,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 10:14:48,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 10:14:48,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,529 INFO L137 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2022-01-18 10:14:48,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 10:14:48,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 10:14:48,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 10:14:48,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 10:14:48,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 10:14:48,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 10:14:48,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 10:14:48,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 10:14:48,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (1/1) ... [2022-01-18 10:14:48,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:14:48,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:48,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 10:14:48,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-18 10:14:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 10:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 10:14:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 10:14:48,621 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 10:14:48,770 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 10:14:48,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 10:14:49,055 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 10:14:49,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 10:14:49,061 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2022-01-18 10:14:49,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:14:49 BoogieIcfgContainer [2022-01-18 10:14:49,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 10:14:49,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 10:14:49,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 10:14:49,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 10:14:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:14:48" (1/3) ... [2022-01-18 10:14:49,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec795b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:14:49, skipping insertion in model container [2022-01-18 10:14:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:48" (2/3) ... [2022-01-18 10:14:49,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec795b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:14:49, skipping insertion in model container [2022-01-18 10:14:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:14:49" (3/3) ... [2022-01-18 10:14:49,071 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2022-01-18 10:14:49,075 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 10:14:49,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 10:14:49,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-18 10:14:49,075 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 10:14:49,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:49,137 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-18 10:14:49,166 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 10:14:49,170 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:14:49,171 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 10:14:49,179 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 213 places, 255 transitions, 518 flow [2022-01-18 10:14:49,343 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6936 states, 6926 states have (on average 2.432861680623737) internal successors, (16850), 6935 states have internal predecessors, (16850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 6936 states, 6926 states have (on average 2.432861680623737) internal successors, (16850), 6935 states have internal predecessors, (16850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-18 10:14:49,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:49,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:49,375 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1130889907, now seen corresponding path program 1 times [2022-01-18 10:14:49,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:49,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414342328] [2022-01-18 10:14:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:49,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:49,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414342328] [2022-01-18 10:14:49,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414342328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:49,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:14:49,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:14:49,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434506223] [2022-01-18 10:14:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:49,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:14:49,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:14:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:14:49,565 INFO L87 Difference]: Start difference. First operand has 6936 states, 6926 states have (on average 2.432861680623737) internal successors, (16850), 6935 states have internal predecessors, (16850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:49,641 INFO L93 Difference]: Finished difference Result 6702 states and 13509 transitions. [2022-01-18 10:14:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:14:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-18 10:14:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:49,683 INFO L225 Difference]: With dead ends: 6702 [2022-01-18 10:14:49,683 INFO L226 Difference]: Without dead ends: 6586 [2022-01-18 10:14:49,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:14:49,689 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:49,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2022-01-18 10:14:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6586. [2022-01-18 10:14:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6577 states have (on average 2.0220465257716285) internal successors, (13299), 6585 states have internal predecessors, (13299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 13299 transitions. [2022-01-18 10:14:49,880 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 13299 transitions. Word has length 44 [2022-01-18 10:14:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:49,881 INFO L470 AbstractCegarLoop]: Abstraction has 6586 states and 13299 transitions. [2022-01-18 10:14:49,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 13299 transitions. [2022-01-18 10:14:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-18 10:14:49,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:49,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:49,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 10:14:49,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1941322512, now seen corresponding path program 1 times [2022-01-18 10:14:49,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475185363] [2022-01-18 10:14:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:49,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:49,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:49,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475185363] [2022-01-18 10:14:49,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475185363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:49,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:14:49,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:14:49,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973860981] [2022-01-18 10:14:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:49,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:14:49,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:49,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:14:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:14:49,935 INFO L87 Difference]: Start difference. First operand 6586 states and 13299 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:49,982 INFO L93 Difference]: Finished difference Result 6590 states and 13303 transitions. [2022-01-18 10:14:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:14:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-18 10:14:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:50,000 INFO L225 Difference]: With dead ends: 6590 [2022-01-18 10:14:50,000 INFO L226 Difference]: Without dead ends: 6590 [2022-01-18 10:14:50,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:14:50,001 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 3 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:50,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2022-01-18 10:14:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6587. [2022-01-18 10:14:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6578 states have (on average 2.021891152325935) internal successors, (13300), 6586 states have internal predecessors, (13300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 13300 transitions. [2022-01-18 10:14:50,121 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 13300 transitions. Word has length 44 [2022-01-18 10:14:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:50,122 INFO L470 AbstractCegarLoop]: Abstraction has 6587 states and 13300 transitions. [2022-01-18 10:14:50,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 13300 transitions. [2022-01-18 10:14:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-18 10:14:50,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:50,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:50,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 10:14:50,124 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1946238832, now seen corresponding path program 1 times [2022-01-18 10:14:50,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:50,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883226418] [2022-01-18 10:14:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:50,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:50,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:50,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883226418] [2022-01-18 10:14:50,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883226418] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:50,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001769687] [2022-01-18 10:14:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:50,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:50,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:50,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 10:14:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:50,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:14:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:50,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:14:50,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001769687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:50,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:14:50,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:14:50,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160615563] [2022-01-18 10:14:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:50,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:14:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:14:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:50,383 INFO L87 Difference]: Start difference. First operand 6587 states and 13300 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:50,485 INFO L93 Difference]: Finished difference Result 6520 states and 13231 transitions. [2022-01-18 10:14:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:14:50,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-18 10:14:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:50,502 INFO L225 Difference]: With dead ends: 6520 [2022-01-18 10:14:50,502 INFO L226 Difference]: Without dead ends: 6520 [2022-01-18 10:14:50,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:50,503 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 66 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:50,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 404 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6520 states. [2022-01-18 10:14:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6520 to 6520. [2022-01-18 10:14:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6513 states have (on average 2.0314755105174265) internal successors, (13231), 6519 states have internal predecessors, (13231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 13231 transitions. [2022-01-18 10:14:50,596 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 13231 transitions. Word has length 49 [2022-01-18 10:14:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:50,596 INFO L470 AbstractCegarLoop]: Abstraction has 6520 states and 13231 transitions. [2022-01-18 10:14:50,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 13231 transitions. [2022-01-18 10:14:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-18 10:14:50,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:50,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:50,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:50,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:50,812 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1108947154, now seen corresponding path program 1 times [2022-01-18 10:14:50,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287810377] [2022-01-18 10:14:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:50,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:50,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:50,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287810377] [2022-01-18 10:14:50,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287810377] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:50,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770855380] [2022-01-18 10:14:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:50,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:50,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:50,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:50,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 10:14:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:50,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:14:50,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:51,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:51,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770855380] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:51,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:51,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:14:51,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924101369] [2022-01-18 10:14:51,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:51,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:14:51,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:14:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:14:51,180 INFO L87 Difference]: Start difference. First operand 6520 states and 13231 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:51,259 INFO L93 Difference]: Finished difference Result 6530 states and 13241 transitions. [2022-01-18 10:14:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:14:51,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-18 10:14:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:51,275 INFO L225 Difference]: With dead ends: 6530 [2022-01-18 10:14:51,276 INFO L226 Difference]: Without dead ends: 6530 [2022-01-18 10:14:51,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:14:51,276 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 12 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:51,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1009 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2022-01-18 10:14:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6530. [2022-01-18 10:14:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 6523 states have (on average 2.029894220450713) internal successors, (13241), 6529 states have internal predecessors, (13241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 13241 transitions. [2022-01-18 10:14:51,387 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 13241 transitions. Word has length 59 [2022-01-18 10:14:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:51,387 INFO L470 AbstractCegarLoop]: Abstraction has 6530 states and 13241 transitions. [2022-01-18 10:14:51,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 13241 transitions. [2022-01-18 10:14:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-18 10:14:51,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:51,389 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:51,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:51,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-18 10:14:51,606 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash 173261010, now seen corresponding path program 2 times [2022-01-18 10:14:51,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:51,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981106131] [2022-01-18 10:14:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:51,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:51,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:51,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981106131] [2022-01-18 10:14:51,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981106131] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:51,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939504848] [2022-01-18 10:14:51,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:14:51,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:51,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:51,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 10:14:51,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 10:14:51,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:14:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-18 10:14:51,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:51,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:14:52,030 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:14:52,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:14:52,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:14:52,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:14:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:14:52,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:14:52,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939504848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:52,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:14:52,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-01-18 10:14:52,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791621581] [2022-01-18 10:14:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:52,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 10:14:52,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 10:14:52,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:14:52,226 INFO L87 Difference]: Start difference. First operand 6530 states and 13241 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:52,749 INFO L93 Difference]: Finished difference Result 20205 states and 41113 transitions. [2022-01-18 10:14:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 10:14:52,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-18 10:14:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:52,795 INFO L225 Difference]: With dead ends: 20205 [2022-01-18 10:14:52,796 INFO L226 Difference]: Without dead ends: 20205 [2022-01-18 10:14:52,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-01-18 10:14:52,797 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 1430 mSDsluCounter, 3950 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4649 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:52,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 4649 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 527 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2022-01-18 10:14:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20205 states. [2022-01-18 10:14:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20205 to 8426. [2022-01-18 10:14:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8426 states, 8419 states have (on average 2.045611117709942) internal successors, (17222), 8425 states have internal predecessors, (17222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8426 states to 8426 states and 17222 transitions. [2022-01-18 10:14:52,959 INFO L78 Accepts]: Start accepts. Automaton has 8426 states and 17222 transitions. Word has length 69 [2022-01-18 10:14:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:52,959 INFO L470 AbstractCegarLoop]: Abstraction has 8426 states and 17222 transitions. [2022-01-18 10:14:52,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8426 states and 17222 transitions. [2022-01-18 10:14:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-18 10:14:52,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:52,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:52,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:53,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:53,182 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1162729581, now seen corresponding path program 1 times [2022-01-18 10:14:53,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:53,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987023396] [2022-01-18 10:14:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:53,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:14:53,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987023396] [2022-01-18 10:14:53,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987023396] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422125624] [2022-01-18 10:14:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:53,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:53,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:53,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:53,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 10:14:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:14:53,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-18 10:14:53,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:14:53,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422125624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:53,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:14:53,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:14:53,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473748241] [2022-01-18 10:14:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:53,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:14:53,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:14:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:53,358 INFO L87 Difference]: Start difference. First operand 8426 states and 17222 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:53,391 INFO L93 Difference]: Finished difference Result 11981 states and 24529 transitions. [2022-01-18 10:14:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:14:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-18 10:14:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:53,409 INFO L225 Difference]: With dead ends: 11981 [2022-01-18 10:14:53,409 INFO L226 Difference]: Without dead ends: 11981 [2022-01-18 10:14:53,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:53,410 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 108 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:53,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 463 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2022-01-18 10:14:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 8501. [2022-01-18 10:14:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8494 states have (on average 2.0455615728749708) internal successors, (17375), 8500 states have internal predecessors, (17375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 17375 transitions. [2022-01-18 10:14:53,557 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 17375 transitions. Word has length 69 [2022-01-18 10:14:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:53,557 INFO L470 AbstractCegarLoop]: Abstraction has 8501 states and 17375 transitions. [2022-01-18 10:14:53,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 17375 transitions. [2022-01-18 10:14:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-18 10:14:53,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:53,559 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:53,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:53,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:53,775 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1532450281, now seen corresponding path program 1 times [2022-01-18 10:14:53,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:53,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765233340] [2022-01-18 10:14:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:53,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:14:53,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765233340] [2022-01-18 10:14:53,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765233340] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732493114] [2022-01-18 10:14:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:53,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:53,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 10:14:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:53,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:14:53,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:54,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:54,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732493114] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:54,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:54,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-18 10:14:54,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080245045] [2022-01-18 10:14:54,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:54,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 10:14:54,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 10:14:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:14:54,158 INFO L87 Difference]: Start difference. First operand 8501 states and 17375 transitions. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:54,311 INFO L93 Difference]: Finished difference Result 877 states and 1641 transitions. [2022-01-18 10:14:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 10:14:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-01-18 10:14:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:54,313 INFO L225 Difference]: With dead ends: 877 [2022-01-18 10:14:54,313 INFO L226 Difference]: Without dead ends: 859 [2022-01-18 10:14:54,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 10:14:54,314 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 384 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:54,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1382 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-01-18 10:14:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2022-01-18 10:14:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.867132867132867) internal successors, (1602), 858 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1602 transitions. [2022-01-18 10:14:54,323 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1602 transitions. Word has length 73 [2022-01-18 10:14:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:54,323 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1602 transitions. [2022-01-18 10:14:54,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1602 transitions. [2022-01-18 10:14:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-18 10:14:54,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:54,325 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:54,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:54,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:54,562 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash -135731538, now seen corresponding path program 1 times [2022-01-18 10:14:54,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:54,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748127026] [2022-01-18 10:14:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:54,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 10:14:54,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:54,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748127026] [2022-01-18 10:14:54,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748127026] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:54,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468962131] [2022-01-18 10:14:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:54,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:54,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:54,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 10:14:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:54,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:14:54,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 10:14:54,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 10:14:55,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468962131] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:55,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:55,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:14:55,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121694168] [2022-01-18 10:14:55,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:55,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:14:55,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:14:55,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:14:55,108 INFO L87 Difference]: Start difference. First operand 859 states and 1602 transitions. Second operand has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:55,305 INFO L93 Difference]: Finished difference Result 874 states and 1617 transitions. [2022-01-18 10:14:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:14:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-01-18 10:14:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:55,306 INFO L225 Difference]: With dead ends: 874 [2022-01-18 10:14:55,307 INFO L226 Difference]: Without dead ends: 874 [2022-01-18 10:14:55,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:14:55,307 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 41 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:55,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 825 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-01-18 10:14:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2022-01-18 10:14:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.852233676975945) internal successors, (1617), 873 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1617 transitions. [2022-01-18 10:14:55,315 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1617 transitions. Word has length 98 [2022-01-18 10:14:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:55,315 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1617 transitions. [2022-01-18 10:14:55,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:14:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1617 transitions. [2022-01-18 10:14:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-18 10:14:55,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:55,316 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:55,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 10:14:55,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:55,532 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:14:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -884417490, now seen corresponding path program 2 times [2022-01-18 10:14:55,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:55,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635242122] [2022-01-18 10:14:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:14:55,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635242122] [2022-01-18 10:14:55,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635242122] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27264912] [2022-01-18 10:14:55,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:14:55,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:55,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:55,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 10:14:55,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:14:55,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:14:55,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-18 10:14:55,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:55,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:14:56,269 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:14:56,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:14:56,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:14:56,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:14:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:14:56,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:15:04,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_260) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-18 10:15:05,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:15:05,141 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:15:05,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:15:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-18 10:15:05,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27264912] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:05,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:05,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-01-18 10:15:05,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462185350] [2022-01-18 10:15:05,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:05,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 10:15:05,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 10:15:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=4, NotChecked=50, Total=756 [2022-01-18 10:15:05,156 INFO L87 Difference]: Start difference. First operand 874 states and 1617 transitions. Second operand has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:15:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:05,800 INFO L93 Difference]: Finished difference Result 2396 states and 4513 transitions. [2022-01-18 10:15:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 10:15:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-18 10:15:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:05,804 INFO L225 Difference]: With dead ends: 2396 [2022-01-18 10:15:05,804 INFO L226 Difference]: Without dead ends: 2396 [2022-01-18 10:15:05,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 213 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=496, Invalid=1310, Unknown=4, NotChecked=82, Total=1892 [2022-01-18 10:15:05,805 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 1511 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:05,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1911 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 441 Invalid, 0 Unknown, 387 Unchecked, 0.2s Time] [2022-01-18 10:15:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2022-01-18 10:15:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 984. [2022-01-18 10:15:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 1.8585961342828077) internal successors, (1827), 983 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:15:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1827 transitions. [2022-01-18 10:15:05,822 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1827 transitions. Word has length 113 [2022-01-18 10:15:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:05,822 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1827 transitions. [2022-01-18 10:15:05,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:15:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1827 transitions. [2022-01-18 10:15:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-18 10:15:05,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:05,824 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:15:05,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 10:15:06,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:06,040 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:15:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash -616054497, now seen corresponding path program 1 times [2022-01-18 10:15:06,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:06,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822366535] [2022-01-18 10:15:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:06,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:15:06,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:06,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822366535] [2022-01-18 10:15:06,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822366535] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:15:06,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294985260] [2022-01-18 10:15:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:06,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:15:06,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:15:06,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 10:15:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:06,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 10:15:06,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:15:06,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:15:07,309 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:15:07,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:15:07,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:15:07,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-18 10:15:07,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-01-18 10:15:07,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:15:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:15:07,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:15:10,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:12,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-18 10:15:14,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-18 10:15:16,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-18 10:15:18,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-18 10:15:20,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-18 10:15:20,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_352) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-18 10:15:20,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:15:20,752 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:15:20,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:15:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:15:20,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294985260] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:20,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:20,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-01-18 10:15:20,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858235293] [2022-01-18 10:15:20,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:20,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 10:15:20,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 10:15:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1402, Unknown=7, NotChecked=486, Total=2070 [2022-01-18 10:15:20,768 INFO L87 Difference]: Start difference. First operand 984 states and 1827 transitions. Second operand has 46 states, 46 states have (on average 5.260869565217392) internal successors, (242), 46 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:15:35,061 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:15:57,103 WARN L228 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:13,143 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:23,015 WARN L228 SmtUtils]: Spent 9.58s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:28,852 WARN L228 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:29,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:16:29,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:16:30,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:16:37,867 WARN L228 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:38,159 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:16:43,302 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:16:43,597 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:16:54,108 WARN L228 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:16:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:54,138 INFO L93 Difference]: Finished difference Result 3137 states and 6134 transitions. [2022-01-18 10:16:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 10:16:54,138 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.260869565217392) internal successors, (242), 46 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-18 10:16:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:54,156 INFO L225 Difference]: With dead ends: 3137 [2022-01-18 10:16:54,157 INFO L226 Difference]: Without dead ends: 3137 [2022-01-18 10:16:54,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 261 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 105.6s TimeCoverageRelationStatistics Valid=1317, Invalid=6373, Unknown=14, NotChecked=2196, Total=9900 [2022-01-18 10:16:54,174 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 2004 mSDsluCounter, 3686 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 3860 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2892 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:54,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2004 Valid, 3860 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 542 Invalid, 0 Unknown, 2892 Unchecked, 0.4s Time] [2022-01-18 10:16:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2022-01-18 10:16:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 1927. [2022-01-18 10:16:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1926 states have (on average 1.9397715472481827) internal successors, (3736), 1926 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:16:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3736 transitions. [2022-01-18 10:16:54,207 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 3736 transitions. Word has length 140 [2022-01-18 10:16:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:54,208 INFO L470 AbstractCegarLoop]: Abstraction has 1927 states and 3736 transitions. [2022-01-18 10:16:54,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.260869565217392) internal successors, (242), 46 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:16:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3736 transitions. [2022-01-18 10:16:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-18 10:16:54,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:54,212 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:16:54,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 10:16:54,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-18 10:16:54,413 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1288668836, now seen corresponding path program 1 times [2022-01-18 10:16:54,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:54,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469188229] [2022-01-18 10:16:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:54,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:55,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469188229] [2022-01-18 10:16:55,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469188229] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032271691] [2022-01-18 10:16:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:55,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:55,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:16:55,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 10:16:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:55,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 10:16:55,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:55,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:16:55,679 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:16:55,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:16:55,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:16:55,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-18 10:16:56,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-01-18 10:16:56,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:16:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:16:56,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:17:00,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:17:00,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-18 10:17:02,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-18 10:17:03,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-18 10:17:03,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-18 10:17:05,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-18 10:17:05,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_448 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_448) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-18 10:17:05,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:17:05,846 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:17:05,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:17:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:17:05,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032271691] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:17:05,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:17:05,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-01-18 10:17:05,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092699986] [2022-01-18 10:17:05,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:17:05,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 10:17:05,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:17:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 10:17:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1401, Unknown=8, NotChecked=486, Total=2070 [2022-01-18 10:17:05,863 INFO L87 Difference]: Start difference. First operand 1927 states and 3736 transitions. Second operand has 46 states, 46 states have (on average 5.326086956521739) internal successors, (245), 46 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:17:17,587 WARN L228 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:17:24,142 WARN L228 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:17:24,586 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:17:36,350 WARN L228 SmtUtils]: Spent 11.58s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:17:36,989 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:17:37,524 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:17:48,603 WARN L228 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:17:49,006 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:17:58,809 WARN L228 SmtUtils]: Spent 9.73s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:04,040 WARN L228 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:04,620 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:18:05,072 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:18:13,927 WARN L228 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:24,223 WARN L228 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:18:24,271 INFO L93 Difference]: Finished difference Result 6477 states and 12322 transitions. [2022-01-18 10:18:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-01-18 10:18:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.326086956521739) internal successors, (245), 46 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-01-18 10:18:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:18:24,290 INFO L225 Difference]: With dead ends: 6477 [2022-01-18 10:18:24,290 INFO L226 Difference]: Without dead ends: 6236 [2022-01-18 10:18:24,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 256 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 12 IntricatePredicates, 9 DeprecatedPredicates, 6714 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=3244, Invalid=15422, Unknown=14, NotChecked=3372, Total=22052 [2022-01-18 10:18:24,296 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 4101 mSDsluCounter, 5617 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 5814 SdHoareTripleChecker+Invalid, 5093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3723 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:18:24,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4101 Valid, 5814 Invalid, 5093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1165 Invalid, 0 Unknown, 3723 Unchecked, 1.1s Time] [2022-01-18 10:18:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2022-01-18 10:18:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 1986. [2022-01-18 10:18:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 1.9113350125944584) internal successors, (3794), 1985 states have internal predecessors, (3794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:18:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 3794 transitions. [2022-01-18 10:18:24,336 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 3794 transitions. Word has length 141 [2022-01-18 10:18:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:18:24,336 INFO L470 AbstractCegarLoop]: Abstraction has 1986 states and 3794 transitions. [2022-01-18 10:18:24,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.326086956521739) internal successors, (245), 46 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:18:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 3794 transitions. [2022-01-18 10:18:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-18 10:18:24,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:18:24,339 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:18:24,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 10:18:24,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:18:24,555 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:18:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:18:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 822719982, now seen corresponding path program 1 times [2022-01-18 10:18:24,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:18:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908770008] [2022-01-18 10:18:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:18:24,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:18:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:18:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:18:25,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:18:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908770008] [2022-01-18 10:18:25,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908770008] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:18:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954676711] [2022-01-18 10:18:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:18:25,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:18:25,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:18:25,312 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:18:25,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 10:18:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:18:25,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 10:18:25,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:18:25,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:18:25,796 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:18:25,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:18:25,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:18:26,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-18 10:18:26,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-01-18 10:18:26,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:18:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:18:26,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:18:30,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:18:32,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) is different from false [2022-01-18 10:18:34,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) is different from false [2022-01-18 10:18:36,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) is different from false [2022-01-18 10:18:36,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|))) is different from false [2022-01-18 10:18:37,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) is different from false [2022-01-18 10:18:37,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-18 10:18:37,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:18:37,616 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:18:37,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:18:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:18:37,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954676711] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:18:37,646 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:18:37,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-01-18 10:18:37,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902479479] [2022-01-18 10:18:37,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:18:37,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 10:18:37,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:18:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 10:18:37,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1401, Unknown=8, NotChecked=486, Total=2070 [2022-01-18 10:18:37,656 INFO L87 Difference]: Start difference. First operand 1986 states and 3794 transitions. Second operand has 46 states, 46 states have (on average 5.391304347826087) internal successors, (248), 46 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:18:49,276 WARN L228 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:49,783 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (or (<= .cse2 0) (= .cse0 .cse1)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-18 10:18:50,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:19:00,897 WARN L228 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:01,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:19:01,937 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:19:12,774 WARN L228 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:13,311 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:19:23,399 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:28,739 WARN L228 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:29,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:19:29,512 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:19:37,898 WARN L228 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:49,099 WARN L228 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:19:49,141 INFO L93 Difference]: Finished difference Result 7513 states and 14414 transitions. [2022-01-18 10:19:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-01-18 10:19:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.391304347826087) internal successors, (248), 46 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-01-18 10:19:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:19:49,151 INFO L225 Difference]: With dead ends: 7513 [2022-01-18 10:19:49,151 INFO L226 Difference]: Without dead ends: 7513 [2022-01-18 10:19:49,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 259 SyntacticMatches, 8 SemanticMatches, 143 ConstructedPredicates, 13 IntricatePredicates, 8 DeprecatedPredicates, 6194 ImplicationChecksByTransitivity, 81.7s TimeCoverageRelationStatistics Valid=3147, Invalid=14182, Unknown=15, NotChecked=3536, Total=20880 [2022-01-18 10:19:49,156 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 4249 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2369 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 10:19:49,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4249 Valid, 4921 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1013 Invalid, 0 Unknown, 2369 Unchecked, 0.8s Time] [2022-01-18 10:19:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2022-01-18 10:19:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 2044. [2022-01-18 10:19:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2043 states have (on average 1.9143416544297602) internal successors, (3911), 2043 states have internal predecessors, (3911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:19:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3911 transitions. [2022-01-18 10:19:49,190 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3911 transitions. Word has length 142 [2022-01-18 10:19:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:19:49,190 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 3911 transitions. [2022-01-18 10:19:49,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.391304347826087) internal successors, (248), 46 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:19:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3911 transitions. [2022-01-18 10:19:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-18 10:19:49,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:19:49,193 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:19:49,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-18 10:19:49,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 10:19:49,408 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:19:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:19:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1822329208, now seen corresponding path program 2 times [2022-01-18 10:19:49,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:19:49,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893577900] [2022-01-18 10:19:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:19:49,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:19:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:19:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:19:50,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:19:50,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893577900] [2022-01-18 10:19:50,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893577900] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:19:50,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303393531] [2022-01-18 10:19:50,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:19:50,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:19:50,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:19:50,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:19:50,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 10:19:50,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:19:50,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:19:50,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-18 10:19:50,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:19:50,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:19:50,666 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:19:50,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:19:50,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:19:50,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-01-18 10:19:51,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-01-18 10:20:07,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-01-18 10:20:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:20:07,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:20:13,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_39|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0))))) is different from false [2022-01-18 10:20:15,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-01-18 10:20:17,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_643)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-01-18 10:20:20,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_643 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_643)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-01-18 10:20:20,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 1) v_ArrVal_643) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 2)))) is different from false [2022-01-18 10:20:21,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (v_ArrVal_640 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_640) |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 1) v_ArrVal_643) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 2)))) is different from false [2022-01-18 10:20:24,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 10:20:24,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:20:24,137 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:20:24,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:20:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 9 not checked. [2022-01-18 10:20:24,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303393531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:20:24,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:20:24,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 44 [2022-01-18 10:20:24,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265652698] [2022-01-18 10:20:24,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:20:24,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-18 10:20:24,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:20:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-18 10:20:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1240, Unknown=22, NotChecked=462, Total=1892 [2022-01-18 10:20:24,154 INFO L87 Difference]: Start difference. First operand 2044 states and 3911 transitions. Second operand has 44 states, 44 states have (on average 5.545454545454546) internal successors, (244), 44 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:20:39,973 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_643 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 1) v_ArrVal_643) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 2)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (= (select |c_#valid| 4) 1) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:20:41,490 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_643 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 1) v_ArrVal_643) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51_160| 2)))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:20:53,361 WARN L228 SmtUtils]: Spent 11.66s on a formula simplification. DAG size of input: 68 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:20:54,014 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (@diff .cse4 .cse0))) (and (exists ((v_ArrVal_642 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_642))) (= .cse0 (store .cse1 .cse2 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (forall ((v_ArrVal_643 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_643)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse3) (= .cse0 (store .cse4 .cse5 0)) (or (<= .cse2 0) (= .cse0 .cse1)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse4) (<= .cse5 0)) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-18 10:20:54,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_642 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_642))) (forall ((v_ArrVal_643 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_643)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) .cse0 (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (or (and .cse0 (= .cse1 .cse2)) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) .cse0 (<= .cse3 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-18 10:21:53,099 WARN L228 SmtUtils]: Spent 17.97s on a formula simplification. DAG size of input: 39 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:22:20,489 WARN L228 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 75 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:22:46,420 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_642 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_642))) (forall ((v_ArrVal_643 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_643)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-18 10:23:09,444 WARN L228 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:23:28,854 WARN L228 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 74 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:23:54,201 WARN L228 SmtUtils]: Spent 9.39s on a formula simplification. DAG size of input: 78 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:16,105 WARN L228 SmtUtils]: Spent 9.50s on a formula simplification. DAG size of input: 80 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:49,961 WARN L228 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 78 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:25:50,926 WARN L228 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 85 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:27:37,679 WARN L228 SmtUtils]: Spent 10.12s on a formula simplification. DAG size of input: 79 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:29:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:29:13,849 INFO L93 Difference]: Finished difference Result 7872 states and 15383 transitions. [2022-01-18 10:29:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-01-18 10:29:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.545454545454546) internal successors, (244), 44 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-01-18 10:29:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:29:13,859 INFO L225 Difference]: With dead ends: 7872 [2022-01-18 10:29:13,859 INFO L226 Difference]: Without dead ends: 7872 [2022-01-18 10:29:13,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 283 SyntacticMatches, 13 SemanticMatches, 138 ConstructedPredicates, 11 IntricatePredicates, 3 DeprecatedPredicates, 6275 ImplicationChecksByTransitivity, 557.9s TimeCoverageRelationStatistics Valid=2665, Invalid=13591, Unknown=300, NotChecked=2904, Total=19460 [2022-01-18 10:29:13,863 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 3276 mSDsluCounter, 4847 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 5018 SdHoareTripleChecker+Invalid, 5882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5180 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 10:29:13,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3276 Valid, 5018 Invalid, 5882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 645 Invalid, 0 Unknown, 5180 Unchecked, 0.5s Time] [2022-01-18 10:29:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7872 states. [2022-01-18 10:29:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7872 to 3253. [2022-01-18 10:29:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3252 states have (on average 1.9572570725707257) internal successors, (6365), 3252 states have internal predecessors, (6365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:29:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 6365 transitions. [2022-01-18 10:29:13,912 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 6365 transitions. Word has length 142 [2022-01-18 10:29:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:29:13,913 INFO L470 AbstractCegarLoop]: Abstraction has 3253 states and 6365 transitions. [2022-01-18 10:29:13,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.545454545454546) internal successors, (244), 44 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:29:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 6365 transitions. [2022-01-18 10:29:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 10:29:13,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:29:13,917 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:29:13,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 10:29:14,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 10:29:14,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:29:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:29:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -386904932, now seen corresponding path program 1 times [2022-01-18 10:29:14,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:29:14,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18739141] [2022-01-18 10:29:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:29:14,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:29:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:29:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:29:14,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:29:14,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18739141] [2022-01-18 10:29:14,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18739141] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:29:14,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826381983] [2022-01-18 10:29:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:29:14,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:29:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:29:14,948 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:29:14,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 10:29:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:29:15,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 10:29:15,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:29:15,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:29:15,418 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:29:15,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:29:15,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:29:15,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-18 10:29:15,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-01-18 10:29:15,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-18 10:29:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:29:15,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:29:20,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:29:20,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-18 10:29:22,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-18 10:29:24,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-18 10:29:24,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-18 10:29:25,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-18 10:29:25,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_736) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2022-01-18 10:29:25,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:29:25,697 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:29:25,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:29:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:29:25,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826381983] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:29:25,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:29:25,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-18 10:29:25,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074577649] [2022-01-18 10:29:25,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:29:25,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 10:29:25,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:29:25,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 10:29:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1477, Unknown=8, NotChecked=498, Total=2162 [2022-01-18 10:29:25,715 INFO L87 Difference]: Start difference. First operand 3253 states and 6365 transitions. Second operand has 47 states, 47 states have (on average 5.340425531914893) internal successors, (251), 47 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-01-18 10:29:26,544 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 10:29:26,545 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 10:29:27,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-18 10:29:27,746 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-18 10:29:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 10:29:27,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=204, Invalid=1704, Unknown=8, NotChecked=534, Total=2450 [2022-01-18 10:29:27,760 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:29:27,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 406 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 146 Unchecked, 0.1s Time] [2022-01-18 10:29:27,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 10:29:27,763 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:306) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 10:29:27,765 INFO L158 Benchmark]: Toolchain (without parser) took 879762.86ms. Allocated memory was 442.5MB in the beginning and 1.0GB in the end (delta: 562.0MB). Free memory was 382.8MB in the beginning and 594.0MB in the end (delta: -211.2MB). Peak memory consumption was 352.8MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 442.5MB. Free memory is still 401.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.55ms. Allocated memory was 442.5MB in the beginning and 564.1MB in the end (delta: 121.6MB). Free memory was 382.6MB in the beginning and 514.9MB in the end (delta: -132.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.64ms. Allocated memory is still 564.1MB. Free memory was 514.9MB in the beginning and 511.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: Boogie Preprocessor took 33.49ms. Allocated memory is still 564.1MB. Free memory was 511.8MB in the beginning and 509.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: RCFGBuilder took 492.65ms. Allocated memory is still 564.1MB. Free memory was 509.3MB in the beginning and 487.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,766 INFO L158 Benchmark]: TraceAbstraction took 878701.40ms. Allocated memory was 564.1MB in the beginning and 1.0GB in the end (delta: 440.4MB). Free memory was 486.6MB in the beginning and 594.0MB in the end (delta: -107.4MB). Peak memory consumption was 334.2MB. Max. memory is 16.0GB. [2022-01-18 10:29:27,767 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-01-18 10:29:27,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 442.5MB. Free memory is still 401.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 467.55ms. Allocated memory was 442.5MB in the beginning and 564.1MB in the end (delta: 121.6MB). Free memory was 382.6MB in the beginning and 514.9MB in the end (delta: -132.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.64ms. Allocated memory is still 564.1MB. Free memory was 514.9MB in the beginning and 511.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.49ms. Allocated memory is still 564.1MB. Free memory was 511.8MB in the beginning and 509.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 492.65ms. Allocated memory is still 564.1MB. Free memory was 509.3MB in the beginning and 487.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 878701.40ms. Allocated memory was 564.1MB in the beginning and 1.0GB in the end (delta: 440.4MB). Free memory was 486.6MB in the beginning and 594.0MB in the end (delta: -107.4MB). Peak memory consumption was 334.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:306) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown