./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:14:37,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:14:37,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:14:37,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:14:37,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:14:37,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:14:37,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:14:37,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:14:37,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:14:37,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:14:37,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:14:37,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:14:37,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:14:37,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:14:37,302 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:14:37,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:14:37,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:14:37,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:14:37,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:14:37,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:14:37,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:14:37,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:14:37,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:14:37,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:14:37,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:14:37,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:14:37,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:14:37,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:14:37,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:14:37,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:14:37,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:14:37,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:14:37,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:14:37,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:14:37,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:14:37,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:14:37,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:14:37,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:14:37,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:14:37,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:14:37,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:14:37,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:14:37,319 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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/UAutomizer-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 -> Automizer 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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2024-10-24 02:14:37,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:14:37,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:14:37,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:14:37,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:14:37,583 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:14:37,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-24 02:14:39,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:14:39,743 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:14:39,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-24 02:14:39,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfc7ec65/e2f5edfe2544463a90299b8877c8566c/FLAGcd92db836 [2024-10-24 02:14:39,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfc7ec65/e2f5edfe2544463a90299b8877c8566c [2024-10-24 02:14:39,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:14:39,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:14:39,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:14:39,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:14:39,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:14:39,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:14:39" (1/1) ... [2024-10-24 02:14:39,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f5034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:39, skipping insertion in model container [2024-10-24 02:14:39,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:14:39" (1/1) ... [2024-10-24 02:14:39,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:14:41,557 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-24 02:14:41,579 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-24 02:14:41,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:14:41,712 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:14:42,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-24 02:14:42,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-24 02:14:42,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:14:42,587 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:14:42,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42 WrapperNode [2024-10-24 02:14:42,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:14:42,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:14:42,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:14:42,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:14:42,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:42,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,134 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-10-24 02:14:43,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:14:43,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:14:43,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:14:43,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:14:43,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 02:14:43,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:14:43,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:14:43,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:14:43,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:14:43,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (1/1) ... [2024-10-24 02:14:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:14:43,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:14:43,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:14:43,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:14:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:14:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 02:14:43,889 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 02:14:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:14:43,890 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:14:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:14:43,891 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:14:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:14:43,891 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:14:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:14:43,892 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:14:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:14:43,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:14:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:14:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:14:43,892 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:14:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:14:43,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:14:44,005 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:14:44,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:14:51,358 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-10-24 02:14:51,359 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:14:51,466 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:14:51,467 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-24 02:14:51,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:14:51 BoogieIcfgContainer [2024-10-24 02:14:51,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:14:51,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:14:51,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:14:51,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:14:51,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:14:39" (1/3) ... [2024-10-24 02:14:51,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5fc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:14:51, skipping insertion in model container [2024-10-24 02:14:51,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:14:42" (2/3) ... [2024-10-24 02:14:51,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5fc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:14:51, skipping insertion in model container [2024-10-24 02:14:51,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:14:51" (3/3) ... [2024-10-24 02:14:51,547 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2024-10-24 02:14:51,563 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:14:51,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:14:51,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:14:51,682 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, 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;@16a7aa2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:14:51,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:14:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 02:14:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:14:51,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:51,708 INFO L215 NwaCegarLoop]: 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] [2024-10-24 02:14:51,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:51,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash -365934265, now seen corresponding path program 1 times [2024-10-24 02:14:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110310782] [2024-10-24 02:14:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:14:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110310782] [2024-10-24 02:14:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110310782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:52,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:14:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:14:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295163479] [2024-10-24 02:14:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:14:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:52,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:14:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:14:52,239 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:53,013 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2024-10-24 02:14:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:14:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-24 02:14:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:53,048 INFO L225 Difference]: With dead ends: 4576 [2024-10-24 02:14:53,048 INFO L226 Difference]: Without dead ends: 2351 [2024-10-24 02:14:53,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:14:53,063 INFO L432 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:53,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:14:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-10-24 02:14:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2024-10-24 02:14:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-24 02:14:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2024-10-24 02:14:53,230 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2024-10-24 02:14:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:53,231 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2024-10-24 02:14:53,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2024-10-24 02:14:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:14:53,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:53,237 INFO L215 NwaCegarLoop]: 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] [2024-10-24 02:14:53,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:14:53,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:53,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 101066947, now seen corresponding path program 1 times [2024-10-24 02:14:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462109275] [2024-10-24 02:14:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:14:53,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:53,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462109275] [2024-10-24 02:14:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462109275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:53,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:14:53,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:14:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435244194] [2024-10-24 02:14:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:53,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:14:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:14:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:53,424 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:54,235 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2024-10-24 02:14:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:14:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-24 02:14:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:54,247 INFO L225 Difference]: With dead ends: 2639 [2024-10-24 02:14:54,248 INFO L226 Difference]: Without dead ends: 2457 [2024-10-24 02:14:54,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:14:54,251 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:54,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 02:14:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-10-24 02:14:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2024-10-24 02:14:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-24 02:14:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2024-10-24 02:14:54,327 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2024-10-24 02:14:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:54,327 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2024-10-24 02:14:54,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2024-10-24 02:14:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:14:54,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:54,333 INFO L215 NwaCegarLoop]: 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] [2024-10-24 02:14:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:14:54,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 524713669, now seen corresponding path program 1 times [2024-10-24 02:14:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124362492] [2024-10-24 02:14:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:14:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:54,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124362492] [2024-10-24 02:14:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124362492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:14:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:14:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887931801] [2024-10-24 02:14:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:54,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:14:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:54,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:14:54,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:54,501 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:55,342 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2024-10-24 02:14:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:14:55,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-24 02:14:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:55,357 INFO L225 Difference]: With dead ends: 2964 [2024-10-24 02:14:55,358 INFO L226 Difference]: Without dead ends: 2698 [2024-10-24 02:14:55,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:14:55,363 INFO L432 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:55,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 02:14:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2024-10-24 02:14:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2024-10-24 02:14:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-24 02:14:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2024-10-24 02:14:55,452 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2024-10-24 02:14:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2024-10-24 02:14:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2024-10-24 02:14:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:14:55,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:55,457 INFO L215 NwaCegarLoop]: 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] [2024-10-24 02:14:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:14:55,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash -847093629, now seen corresponding path program 1 times [2024-10-24 02:14:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63322424] [2024-10-24 02:14:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:14:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63322424] [2024-10-24 02:14:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63322424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:55,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:14:55,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:14:55,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404165748] [2024-10-24 02:14:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:55,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:14:55,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:14:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:55,578 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:56,403 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2024-10-24 02:14:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:14:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-24 02:14:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:56,417 INFO L225 Difference]: With dead ends: 3480 [2024-10-24 02:14:56,418 INFO L226 Difference]: Without dead ends: 3049 [2024-10-24 02:14:56,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:14:56,422 INFO L432 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:56,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:14:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2024-10-24 02:14:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2024-10-24 02:14:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-24 02:14:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2024-10-24 02:14:56,528 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2024-10-24 02:14:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:56,528 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2024-10-24 02:14:56,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2024-10-24 02:14:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:14:56,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:56,531 INFO L215 NwaCegarLoop]: 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] [2024-10-24 02:14:56,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:14:56,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1602506501, now seen corresponding path program 1 times [2024-10-24 02:14:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979972144] [2024-10-24 02:14:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:14:56,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979972144] [2024-10-24 02:14:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979972144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:14:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:14:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823197430] [2024-10-24 02:14:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:56,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:14:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:14:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:14:56,614 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:57,242 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2024-10-24 02:14:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:14:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-24 02:14:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:57,260 INFO L225 Difference]: With dead ends: 4114 [2024-10-24 02:14:57,260 INFO L226 Difference]: Without dead ends: 3403 [2024-10-24 02:14:57,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 02:14:57,265 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:57,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:14:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-10-24 02:14:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2024-10-24 02:14:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-24 02:14:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2024-10-24 02:14:57,404 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2024-10-24 02:14:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:57,404 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2024-10-24 02:14:57,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:14:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2024-10-24 02:14:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 02:14:57,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:57,408 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:14:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:14:57,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -179544944, now seen corresponding path program 1 times [2024-10-24 02:14:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078300928] [2024-10-24 02:14:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 02:14:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:14:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 02:14:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 02:14:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078300928] [2024-10-24 02:14:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078300928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:14:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379767626] [2024-10-24 02:14:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:57,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:14:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:14:57,542 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) [2024-10-24 02:14:57,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:14:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:57,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:14:57,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:14:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 02:14:57,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:14:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379767626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:57,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:14:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 02:14:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805576971] [2024-10-24 02:14:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:14:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:14:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:57,704 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:14:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:57,879 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2024-10-24 02:14:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:14:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-24 02:14:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:57,902 INFO L225 Difference]: With dead ends: 5267 [2024-10-24 02:14:57,902 INFO L226 Difference]: Without dead ends: 4185 [2024-10-24 02:14:57,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:57,910 INFO L432 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:57,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:14:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2024-10-24 02:14:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2024-10-24 02:14:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2024-10-24 02:14:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2024-10-24 02:14:58,206 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2024-10-24 02:14:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:58,207 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2024-10-24 02:14:58,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:14:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2024-10-24 02:14:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 02:14:58,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:58,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:14:58,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 02:14:58,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 02:14:58,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 20714924, now seen corresponding path program 1 times [2024-10-24 02:14:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990485302] [2024-10-24 02:14:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 02:14:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:14:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 02:14:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:14:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 02:14:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 02:14:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990485302] [2024-10-24 02:14:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990485302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:14:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826740822] [2024-10-24 02:14:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:14:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:14:58,583 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) [2024-10-24 02:14:58,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:14:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:58,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:14:58,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:14:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 02:14:58,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:14:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826740822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:14:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:14:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 02:14:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552872362] [2024-10-24 02:14:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:14:58,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:14:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:14:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:14:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:58,793 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 02:14:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:14:59,130 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2024-10-24 02:14:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:14:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-10-24 02:14:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:14:59,172 INFO L225 Difference]: With dead ends: 8169 [2024-10-24 02:14:59,173 INFO L226 Difference]: Without dead ends: 6117 [2024-10-24 02:14:59,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:14:59,190 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:14:59,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:14:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2024-10-24 02:14:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2024-10-24 02:14:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2024-10-24 02:14:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2024-10-24 02:14:59,632 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2024-10-24 02:14:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:14:59,634 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2024-10-24 02:14:59,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 02:14:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2024-10-24 02:14:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:14:59,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:14:59,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-10-24 02:14:59,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 02:14:59,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 02:14:59,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:14:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:14:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1514455832, now seen corresponding path program 1 times [2024-10-24 02:14:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:14:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080185911] [2024-10-24 02:14:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:14:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:14:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:14:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:14:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:14:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:14:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:14:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 02:14:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:14:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 02:14:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:14:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:14:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:14:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-24 02:14:59,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:14:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080185911] [2024-10-24 02:14:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080185911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:14:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240807635] [2024-10-24 02:14:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:14:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:14:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:14:59,992 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) [2024-10-24 02:14:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 02:15:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:00,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 02:15:00,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 02:15:00,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240807635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 02:15:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604092658] [2024-10-24 02:15:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:00,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:00,173 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 02:15:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:00,615 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2024-10-24 02:15:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2024-10-24 02:15:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:00,651 INFO L225 Difference]: With dead ends: 9149 [2024-10-24 02:15:00,651 INFO L226 Difference]: Without dead ends: 6373 [2024-10-24 02:15:00,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:00,663 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:00,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2024-10-24 02:15:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2024-10-24 02:15:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2024-10-24 02:15:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2024-10-24 02:15:00,939 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2024-10-24 02:15:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2024-10-24 02:15:00,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 02:15:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2024-10-24 02:15:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 02:15:00,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:00,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:00,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 02:15:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:01,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:01,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash -444169551, now seen corresponding path program 1 times [2024-10-24 02:15:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557222588] [2024-10-24 02:15:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 02:15:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 02:15:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 02:15:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 02:15:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-24 02:15:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557222588] [2024-10-24 02:15:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557222588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652317224] [2024-10-24 02:15:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:01,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:01,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:01,260 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) [2024-10-24 02:15:01,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 02:15:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:01,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:15:01,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 02:15:01,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652317224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 02:15:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807952177] [2024-10-24 02:15:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:01,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:01,387 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 02:15:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:01,824 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2024-10-24 02:15:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:01,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-24 02:15:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:01,868 INFO L225 Difference]: With dead ends: 14423 [2024-10-24 02:15:01,868 INFO L226 Difference]: Without dead ends: 10223 [2024-10-24 02:15:01,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:01,885 INFO L432 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:01,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2024-10-24 02:15:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2024-10-24 02:15:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-24 02:15:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2024-10-24 02:15:02,545 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2024-10-24 02:15:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:02,546 INFO L471 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2024-10-24 02:15:02,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 02:15:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2024-10-24 02:15:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 02:15:02,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:02,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-10-24 02:15:02,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 02:15:02,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:02,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490321, now seen corresponding path program 1 times [2024-10-24 02:15:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318088438] [2024-10-24 02:15:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 02:15:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 02:15:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318088438] [2024-10-24 02:15:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318088438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949359692] [2024-10-24 02:15:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:02,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:02,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:02,897 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) [2024-10-24 02:15:02,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 02:15:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:02,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 02:15:02,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 02:15:03,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949359692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 02:15:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595999206] [2024-10-24 02:15:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:03,034 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 02:15:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:03,363 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2024-10-24 02:15:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2024-10-24 02:15:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:03,410 INFO L225 Difference]: With dead ends: 14381 [2024-10-24 02:15:03,410 INFO L226 Difference]: Without dead ends: 10227 [2024-10-24 02:15:03,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:03,429 INFO L432 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:03,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2024-10-24 02:15:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2024-10-24 02:15:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-24 02:15:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2024-10-24 02:15:04,055 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2024-10-24 02:15:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:04,056 INFO L471 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2024-10-24 02:15:04,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 02:15:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2024-10-24 02:15:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 02:15:04,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:04,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:04,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 02:15:04,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 02:15:04,276 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:04,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1898602929, now seen corresponding path program 1 times [2024-10-24 02:15:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496058643] [2024-10-24 02:15:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 02:15:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 02:15:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496058643] [2024-10-24 02:15:04,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496058643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762473915] [2024-10-24 02:15:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:04,387 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) [2024-10-24 02:15:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 02:15:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:04,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:15:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 02:15:04,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762473915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 02:15:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971647150] [2024-10-24 02:15:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:04,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:04,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:04,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:04,518 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 02:15:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:04,902 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2024-10-24 02:15:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2024-10-24 02:15:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:04,989 INFO L225 Difference]: With dead ends: 16127 [2024-10-24 02:15:04,989 INFO L226 Difference]: Without dead ends: 9051 [2024-10-24 02:15:05,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:05,014 INFO L432 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:05,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2024-10-24 02:15:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2024-10-24 02:15:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2024-10-24 02:15:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2024-10-24 02:15:05,641 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2024-10-24 02:15:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2024-10-24 02:15:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 02:15:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2024-10-24 02:15:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 02:15:05,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:05,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:05,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 02:15:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:05,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -315841116, now seen corresponding path program 1 times [2024-10-24 02:15:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758662794] [2024-10-24 02:15:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 02:15:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758662794] [2024-10-24 02:15:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758662794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186201474] [2024-10-24 02:15:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:05,999 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) [2024-10-24 02:15:06,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 02:15:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:06,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 02:15:06,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 02:15:06,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186201474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:06,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:06,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 02:15:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639523908] [2024-10-24 02:15:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:06,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:15:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:06,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:15:06,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 02:15:06,197 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:06,814 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2024-10-24 02:15:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:15:06,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-24 02:15:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:06,844 INFO L225 Difference]: With dead ends: 11183 [2024-10-24 02:15:06,845 INFO L226 Difference]: Without dead ends: 6959 [2024-10-24 02:15:06,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 02:15:06,861 INFO L432 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:06,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:15:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2024-10-24 02:15:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2024-10-24 02:15:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-10-24 02:15:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2024-10-24 02:15:07,375 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2024-10-24 02:15:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:07,376 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2024-10-24 02:15:07,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2024-10-24 02:15:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 02:15:07,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:07,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:07,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 02:15:07,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:07,589 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1934816030, now seen corresponding path program 1 times [2024-10-24 02:15:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967152544] [2024-10-24 02:15:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 02:15:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967152544] [2024-10-24 02:15:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967152544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153601916] [2024-10-24 02:15:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:07,728 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) [2024-10-24 02:15:07,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 02:15:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:07,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 02:15:07,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 02:15:07,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:07,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153601916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:07,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 02:15:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123266241] [2024-10-24 02:15:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:07,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:15:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:15:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 02:15:07,918 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:08,450 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2024-10-24 02:15:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:15:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-24 02:15:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:08,472 INFO L225 Difference]: With dead ends: 10847 [2024-10-24 02:15:08,472 INFO L226 Difference]: Without dead ends: 6579 [2024-10-24 02:15:08,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:15:08,485 INFO L432 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:08,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 02:15:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-24 02:15:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2024-10-24 02:15:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-10-24 02:15:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2024-10-24 02:15:08,743 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2024-10-24 02:15:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2024-10-24 02:15:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2024-10-24 02:15:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 02:15:08,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:08,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:08,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 02:15:08,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 02:15:08,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1476642276, now seen corresponding path program 1 times [2024-10-24 02:15:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:08,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645740132] [2024-10-24 02:15:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 02:15:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645740132] [2024-10-24 02:15:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645740132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567399401] [2024-10-24 02:15:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:09,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:09,044 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) [2024-10-24 02:15:09,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 02:15:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:15:09,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-24 02:15:09,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567399401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:09,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:09,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-24 02:15:09,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875299470] [2024-10-24 02:15:09,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:09,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:15:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:15:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:09,148 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:09,365 INFO L93 Difference]: Finished difference Result 6815 states and 9762 transitions. [2024-10-24 02:15:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:15:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-24 02:15:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:09,388 INFO L225 Difference]: With dead ends: 6815 [2024-10-24 02:15:09,388 INFO L226 Difference]: Without dead ends: 3962 [2024-10-24 02:15:09,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:09,396 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 0 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:09,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12247 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-10-24 02:15:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2024-10-24 02:15:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3595 states have (on average 1.5794158553546593) internal successors, (5678), 3613 states have internal predecessors, (5678), 209 states have call successors, (209), 147 states have call predecessors, (209), 156 states have return successors, (250), 203 states have call predecessors, (250), 207 states have call successors, (250) [2024-10-24 02:15:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6137 transitions. [2024-10-24 02:15:09,549 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6137 transitions. Word has length 125 [2024-10-24 02:15:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 6137 transitions. [2024-10-24 02:15:09,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6137 transitions. [2024-10-24 02:15:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 02:15:09,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:09,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:09,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 02:15:09,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 02:15:09,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -985130332, now seen corresponding path program 1 times [2024-10-24 02:15:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100606454] [2024-10-24 02:15:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 02:15:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100606454] [2024-10-24 02:15:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100606454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859842389] [2024-10-24 02:15:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:09,858 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) [2024-10-24 02:15:09,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 02:15:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:09,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:15:09,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 02:15:09,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859842389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:09,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:09,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-24 02:15:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955177001] [2024-10-24 02:15:09,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:09,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:15:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:15:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:09,958 INFO L87 Difference]: Start difference. First operand 3962 states and 6137 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:10,084 INFO L93 Difference]: Finished difference Result 5053 states and 7447 transitions. [2024-10-24 02:15:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:15:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-24 02:15:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:10,093 INFO L225 Difference]: With dead ends: 5053 [2024-10-24 02:15:10,093 INFO L226 Difference]: Without dead ends: 2852 [2024-10-24 02:15:10,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:10,098 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:10,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-10-24 02:15:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2024-10-24 02:15:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-24 02:15:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2024-10-24 02:15:10,185 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2024-10-24 02:15:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:10,186 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2024-10-24 02:15:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2024-10-24 02:15:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 02:15:10,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:10,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:10,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 02:15:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 02:15:10,390 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -88102940, now seen corresponding path program 1 times [2024-10-24 02:15:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368209611] [2024-10-24 02:15:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-24 02:15:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368209611] [2024-10-24 02:15:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368209611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:15:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024326426] [2024-10-24 02:15:10,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:15:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:15:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:10,548 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 02:15:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:11,047 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2024-10-24 02:15:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:15:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2024-10-24 02:15:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:11,060 INFO L225 Difference]: With dead ends: 2874 [2024-10-24 02:15:11,060 INFO L226 Difference]: Without dead ends: 2871 [2024-10-24 02:15:11,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 02:15:11,062 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:11,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:15:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-10-24 02:15:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2024-10-24 02:15:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-24 02:15:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2024-10-24 02:15:11,160 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2024-10-24 02:15:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:11,161 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2024-10-24 02:15:11,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 02:15:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2024-10-24 02:15:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 02:15:11,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:11,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:11,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 02:15:11,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:11,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1275818764, now seen corresponding path program 1 times [2024-10-24 02:15:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290985509] [2024-10-24 02:15:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 02:15:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:15:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 02:15:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 02:15:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 02:15:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 02:15:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 02:15:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 02:15:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-24 02:15:11,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290985509] [2024-10-24 02:15:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290985509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:15:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426246076] [2024-10-24 02:15:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:15:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:15:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:15:11,240 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:11,486 INFO L93 Difference]: Finished difference Result 3238 states and 5230 transitions. [2024-10-24 02:15:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:15:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2024-10-24 02:15:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:11,497 INFO L225 Difference]: With dead ends: 3238 [2024-10-24 02:15:11,498 INFO L226 Difference]: Without dead ends: 2873 [2024-10-24 02:15:11,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:11,500 INFO L432 NwaCegarLoop]: 4041 mSDtfsCounter, 90 mSDsluCounter, 12024 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16065 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:11,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 16065 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 02:15:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-24 02:15:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2853. [2024-10-24 02:15:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-24 02:15:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2024-10-24 02:15:11,593 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2024-10-24 02:15:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:11,594 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2024-10-24 02:15:11,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 02:15:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2024-10-24 02:15:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 02:15:11,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:11,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 02:15:11,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 02:15:11,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:11,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2124916191, now seen corresponding path program 1 times [2024-10-24 02:15:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616177841] [2024-10-24 02:15:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 02:15:11,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 02:15:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 02:15:11,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 02:15:11,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 02:15:11,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-24 02:15:11,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-24 02:15:11,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 02:15:11,704 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:15:11,814 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 02:15:11,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:15:11 BoogieIcfgContainer [2024-10-24 02:15:11,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 02:15:11,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 02:15:11,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 02:15:11,820 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 02:15:11,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:14:51" (3/4) ... [2024-10-24 02:15:11,821 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 02:15:11,923 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 02:15:11,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 02:15:11,924 INFO L158 Benchmark]: Toolchain (without parser) took 32121.72ms. Allocated memory was 172.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 125.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-24 02:15:11,924 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory was 130.5MB in the beginning and 130.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 02:15:11,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2782.51ms. Allocated memory was 172.0MB in the beginning and 314.6MB in the end (delta: 142.6MB). Free memory was 125.2MB in the beginning and 161.5MB in the end (delta: -36.3MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2024-10-24 02:15:11,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 546.40ms. Allocated memory is still 314.6MB. Free memory was 160.4MB in the beginning and 175.1MB in the end (delta: -14.7MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-10-24 02:15:11,925 INFO L158 Benchmark]: Boogie Preprocessor took 662.52ms. Allocated memory was 314.6MB in the beginning and 629.1MB in the end (delta: 314.6MB). Free memory was 175.1MB in the beginning and 459.3MB in the end (delta: -284.2MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-10-24 02:15:11,925 INFO L158 Benchmark]: RCFGBuilder took 7668.14ms. Allocated memory was 629.1MB in the beginning and 1.1GB in the end (delta: 501.2MB). Free memory was 459.3MB in the beginning and 556.2MB in the end (delta: -96.9MB). Peak memory consumption was 403.2MB. Max. memory is 16.1GB. [2024-10-24 02:15:11,926 INFO L158 Benchmark]: TraceAbstraction took 20278.17ms. Allocated memory was 1.1GB in the beginning and 2.9GB in the end (delta: 1.8GB). Free memory was 927.2MB in the beginning and 1.2GB in the end (delta: -322.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-10-24 02:15:11,926 INFO L158 Benchmark]: Witness Printer took 104.24ms. Allocated memory is still 2.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 02:15:11,927 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.11ms. Allocated memory is still 172.0MB. Free memory was 130.5MB in the beginning and 130.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2782.51ms. Allocated memory was 172.0MB in the beginning and 314.6MB in the end (delta: 142.6MB). Free memory was 125.2MB in the beginning and 161.5MB in the end (delta: -36.3MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 546.40ms. Allocated memory is still 314.6MB. Free memory was 160.4MB in the beginning and 175.1MB in the end (delta: -14.7MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 662.52ms. Allocated memory was 314.6MB in the beginning and 629.1MB in the end (delta: 314.6MB). Free memory was 175.1MB in the beginning and 459.3MB in the end (delta: -284.2MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7668.14ms. Allocated memory was 629.1MB in the beginning and 1.1GB in the end (delta: 501.2MB). Free memory was 459.3MB in the beginning and 556.2MB in the end (delta: -96.9MB). Peak memory consumption was 403.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20278.17ms. Allocated memory was 1.1GB in the beginning and 2.9GB in the end (delta: 1.8GB). Free memory was 927.2MB in the beginning and 1.2GB in the end (delta: -322.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 104.24ms. Allocated memory is still 2.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11118]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46577 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46481 mSDsluCounter, 211874 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142147 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4485 IncrementalHoareTripleChecker+Invalid, 4912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 69727 mSDtfsCounter, 4485 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2839 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 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! [2024-10-24 02:15:11,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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