./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fbcb9f20 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 --- Real Ultimate output --- This is Ultimate 0.2.3-?-fbcb9f2-m [2023-11-24 02:45:58,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 02:45:58,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-24 02:45:58,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 02:45:58,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 02:45:58,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 02:45:58,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 02:45:58,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 02:45:58,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 02:45:58,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 02:45:58,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 02:45:58,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 02:45:58,738 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 02:45:58,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 02:45:58,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 02:45:58,739 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 02:45:58,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 02:45:58,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 02:45:58,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 02:45:58,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 02:45:58,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 02:45:58,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 02:45:58,741 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 02:45:58,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 02:45:58,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 02:45:58,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 02:45:58,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 02:45:58,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 02:45:58,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 02:45:58,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 02:45:58,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 02:45:58,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 02:45:58,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 02:45:58,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 02:45:58,744 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 02:45:58,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 02:45:58,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 02:45:58,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 02:45:58,745 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 02:45:58,745 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 02:45:58,746 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 02:45:58,746 INFO L153 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 [2023-11-24 02:45:58,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 02:45:59,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 02:45:59,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 02:45:59,015 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 02:45:59,015 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 02:45:59,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2023-11-24 02:46:00,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 02:46:00,365 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 02:46:00,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2023-11-24 02:46:00,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ea892f4f3/08d3e9b3e73140729ab1891ab19cb4fc/FLAG4015cb8f6 [2023-11-24 02:46:00,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ea892f4f3/08d3e9b3e73140729ab1891ab19cb4fc [2023-11-24 02:46:00,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 02:46:00,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 02:46:00,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 02:46:00,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 02:46:00,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 02:46:00,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7816713d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00, skipping insertion in model container [2023-11-24 02:46:00,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 02:46:00,660 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2023-11-24 02:46:00,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 02:46:00,693 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 02:46:00,728 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2023-11-24 02:46:00,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 02:46:00,767 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 02:46:00,768 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 02:46:00,773 INFO L206 MainTranslator]: Completed translation [2023-11-24 02:46:00,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00 WrapperNode [2023-11-24 02:46:00,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 02:46:00,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 02:46:00,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 02:46:00,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 02:46:00,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,828 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2023-11-24 02:46:00,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 02:46:00,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 02:46:00,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 02:46:00,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 02:46:00,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 02:46:00,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 02:46:00,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 02:46:00,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 02:46:00,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (1/1) ... [2023-11-24 02:46:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 02:46:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:00,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 02:46:00,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 02:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-24 02:46:00,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-24 02:46:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-24 02:46:00,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-24 02:46:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 02:46:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 02:46:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 02:46:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 02:46:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 02:46:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 02:46:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 02:46:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 02:46:00,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 02:46:00,965 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 02:46:01,097 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 02:46:01,099 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 02:46:01,235 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 02:46:01,311 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 02:46:01,311 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 02:46:01,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:46:01 BoogieIcfgContainer [2023-11-24 02:46:01,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 02:46:01,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 02:46:01,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 02:46:01,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 02:46:01,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:46:00" (1/3) ... [2023-11-24 02:46:01,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1fb887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:46:01, skipping insertion in model container [2023-11-24 02:46:01,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:46:00" (2/3) ... [2023-11-24 02:46:01,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1fb887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:46:01, skipping insertion in model container [2023-11-24 02:46:01,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:46:01" (3/3) ... [2023-11-24 02:46:01,332 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2023-11-24 02:46:01,340 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 02:46:01,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 02:46:01,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 02:46:01,348 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 02:46:01,418 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 02:46:01,457 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:46:01,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 02:46:01,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:01,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 02:46:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 02:46:01,498 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 02:46:01,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 02:46:01,515 INFO L357 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b25557f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:46:01,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-24 02:46:01,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:01,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1154782991, now seen corresponding path program 1 times [2023-11-24 02:46:01,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513353896] [2023-11-24 02:46:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513353896] [2023-11-24 02:46:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513353896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:46:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:46:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 02:46:01,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189615185] [2023-11-24 02:46:01,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:46:01,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:46:01,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:46:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:46:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:01,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:01,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-11-24 02:46:01,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:02,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 02:46:02,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:02,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 448548510, now seen corresponding path program 1 times [2023-11-24 02:46:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306877012] [2023-11-24 02:46:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306877012] [2023-11-24 02:46:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306877012] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:46:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955486303] [2023-11-24 02:46:02,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:02,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:02,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:02,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:46:02,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 02:46:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:02,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 02:46:02,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:46:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:02,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:46:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955486303] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:46:02,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:46:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-24 02:46:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407687073] [2023-11-24 02:46:02,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:46:02,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 02:46:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 02:46:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-24 02:46:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:02,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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) [2023-11-24 02:46:02,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:02,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:02,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 02:46:02,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-24 02:46:02,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:02,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1903132337, now seen corresponding path program 2 times [2023-11-24 02:46:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941162155] [2023-11-24 02:46:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941162155] [2023-11-24 02:46:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941162155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:46:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382054482] [2023-11-24 02:46:02,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 02:46:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:02,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:46:02,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 02:46:03,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 02:46:03,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:46:03,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 02:46:03,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:46:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:03,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:46:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382054482] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:46:03,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:46:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-24 02:46:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555319163] [2023-11-24 02:46:03,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:46:03,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-24 02:46:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:03,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-24 02:46:03,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-24 02:46:03,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:03,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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) [2023-11-24 02:46:03,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:03,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:03,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:03,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 02:46:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:03,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:03,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1557716143, now seen corresponding path program 3 times [2023-11-24 02:46:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686998065] [2023-11-24 02:46:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686998065] [2023-11-24 02:46:03,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686998065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:46:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590440008] [2023-11-24 02:46:03,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 02:46:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:03,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:46:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 02:46:03,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-24 02:46:03,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:46:03,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 02:46:03,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:46:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:03,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:46:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590440008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:46:03,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:46:03,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2023-11-24 02:46:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563615108] [2023-11-24 02:46:03,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:46:03,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-24 02:46:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-24 02:46:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2023-11-24 02:46:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:03,993 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:03,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 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) [2023-11-24 02:46:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:04,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 02:46:04,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:04,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:04,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash 569218279, now seen corresponding path program 1 times [2023-11-24 02:46:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:04,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546167145] [2023-11-24 02:46:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:04,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546167145] [2023-11-24 02:46:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546167145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:46:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219547468] [2023-11-24 02:46:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:04,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:04,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:04,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:46:04,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 02:46:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:04,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 02:46:04,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:46:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-24 02:46:04,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:46:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219547468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:46:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:46:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-11-24 02:46:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896529234] [2023-11-24 02:46:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:46:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 02:46:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 02:46:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2023-11-24 02:46:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:04,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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) [2023-11-24 02:46:04,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:04,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:04,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:04,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:04,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:04,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 02:46:04,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:04,945 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:04,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1734026796, now seen corresponding path program 1 times [2023-11-24 02:46:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:04,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940957044] [2023-11-24 02:46:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:46:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940957044] [2023-11-24 02:46:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940957044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:46:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107710693] [2023-11-24 02:46:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:46:05,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:46:05,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 02:46:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:46:05,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 02:46:05,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:46:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:05,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:46:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:46:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107710693] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:46:05,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:46:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2023-11-24 02:46:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768854043] [2023-11-24 02:46:05,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:46:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 02:46:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:46:05,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 02:46:05,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2023-11-24 02:46:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:05,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:46:05,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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) [2023-11-24 02:46:05,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:05,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:05,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:05,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:05,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:05,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:46:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:46:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:46:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 02:46:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 02:46:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 02:46:05,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 02:46:05,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:46:05,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 02:46:05,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:46:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash -765694188, now seen corresponding path program 2 times [2023-11-24 02:46:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:46:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133431924] [2023-11-24 02:46:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:46:05,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:46:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 02:46:05,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 02:46:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 02:46:05,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 02:46:05,726 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 02:46:05,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-24 02:46:05,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-24 02:46:05,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-24 02:46:05,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 02:46:05,739 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-11-24 02:46:05,742 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 02:46:05,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 02:46:05,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-24 02:46:05,798 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-24 02:46:05,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 02:46:05 BasicIcfg [2023-11-24 02:46:05,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 02:46:05,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 02:46:05,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 02:46:05,826 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 02:46:05,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:46:01" (3/4) ... [2023-11-24 02:46:05,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 02:46:05,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-24 02:46:05,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-24 02:46:05,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2023-11-24 02:46:05,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 02:46:05,895 INFO L158 Benchmark]: Toolchain (without parser) took 5508.52ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 112.2MB in the beginning and 171.9MB in the end (delta: -59.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 02:46:05,895 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 02:46:05,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.73ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 92.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 182.5MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,896 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 182.5MB. Free memory was 90.5MB in the beginning and 88.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,896 INFO L158 Benchmark]: RCFGBuilder took 449.23ms. Allocated memory is still 182.5MB. Free memory was 88.8MB in the beginning and 65.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,896 INFO L158 Benchmark]: TraceAbstraction took 4500.88ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 64.4MB in the beginning and 186.6MB in the end (delta: -122.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,896 INFO L158 Benchmark]: Witness Printer took 68.96ms. Allocated memory is still 239.1MB. Free memory was 186.6MB in the beginning and 171.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-24 02:46:05,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.73ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 92.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 182.5MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 182.5MB. Free memory was 90.5MB in the beginning and 88.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.23ms. Allocated memory is still 182.5MB. Free memory was 88.8MB in the beginning and 65.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4500.88ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 64.4MB in the beginning and 186.6MB in the end (delta: -122.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 68.96ms. Allocated memory is still 239.1MB. Free memory was 186.6MB in the beginning and 171.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3668, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 719, dependent conditional: 712, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2956, independent: 2718, independent conditional: 0, independent unconditional: 2718, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 712 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3668, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 719, dependent conditional: 712, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 2702, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2956, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 238, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 238, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2956, independent: 2718, independent conditional: 0, independent unconditional: 2718, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 712 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=0, id1={3:0}, id2={5:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=1, id1={3:0}, id2={5:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=234, argc=234, argv={235:236}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=234, arg={0:0}, argc=234, argv={235:236}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=234, arg={0:0}, arg={0:0}, arg={0:0}, argc=234, argv={235:236}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND FALSE 1 !(p < 5) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 5) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=21, p=5, prev=13, q=5, x=7] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=34, p=5, prev=21, q=5, x=8] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=55, p=5, prev=34, q=5, x=9] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=89, p=5, prev=55, q=5, x=10] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=144, p=5, prev=89, q=5, x=11] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L705] COND FALSE 0 !(x < 12) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=234, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=234, argv={235:236}, assert_cond=0, correct=144, cur=233, i=89, id1={3:0}, id2={5:0}, j=144, next=233, p=5, prev=144, q=5, x=12] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1295 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 640/1886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-24 02:46:05,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-11-24 02:46:06,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE