./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.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.03.cil-1.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 d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:24:27,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:24:27,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:24:27,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:24:27,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:24:27,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:24:27,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:24:27,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:24:27,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:24:27,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:24:27,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:24:27,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:24:27,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:24:27,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:24:27,477 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:24:27,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:24:27,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:24:27,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:24:27,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:24:27,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:24:27,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:24:27,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:24:27,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:24:27,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:24:27,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:24:27,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:24:27,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:24:27,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:24:27,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:24:27,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:24:27,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:24:27,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:24:27,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:24:27,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:24:27,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:24:27,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:24:27,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:24:27,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:24:27,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:24:27,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:24:27,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:24:27,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:24:27,500 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 -> d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 [2024-10-14 04:24:27,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:24:27,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:24:27,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:24:27,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:24:27,789 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:24:27,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2024-10-14 04:24:29,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:24:29,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:24:29,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2024-10-14 04:24:29,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1437b9b/be62a389d6a44450ad954bfc9b2c3e15/FLAGc633874c5 [2024-10-14 04:24:30,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1437b9b/be62a389d6a44450ad954bfc9b2c3e15 [2024-10-14 04:24:30,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:24:30,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:24:30,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:24:30,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:24:30,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:24:30,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:30,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cfc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30, skipping insertion in model container [2024-10-14 04:24:30,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:30,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:24:32,287 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.03.cil-1.c[381679,381692] [2024-10-14 04:24:32,321 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.03.cil-1.c[383339,383352] [2024-10-14 04:24:32,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:24:32,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:24:33,282 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.03.cil-1.c[381679,381692] [2024-10-14 04:24:33,287 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.03.cil-1.c[383339,383352] [2024-10-14 04:24:33,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:24:33,367 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:24:33,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33 WrapperNode [2024-10-14 04:24:33,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:24:33,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:24:33,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:24:33,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:24:33,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:33,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:33,775 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12699 [2024-10-14 04:24:33,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:24:33,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:24:33,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:24:33,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:24:33,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:33,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:33,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,062 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-14 04:24:34,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:24:34,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:24:34,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:24:34,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:24:34,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (1/1) ... [2024-10-14 04:24:34,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:24:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:34,506 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-14 04:24:34,509 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-14 04:24:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:24:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:24:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:24:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:24:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:24:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:24:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:24:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 04:24:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 04:24:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:24:34,559 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:24:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:24:34,560 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:24:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:24:34,561 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:24:34,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:24:34,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:24:34,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:24:34,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:24:34,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:24:42,203 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-10-14 04:24:42,204 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:24:42,324 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:24:42,324 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-14 04:24:42,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:42 BoogieIcfgContainer [2024-10-14 04:24:42,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:24:42,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:24:42,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:24:42,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:24:42,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:24:30" (1/3) ... [2024-10-14 04:24:42,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85d3666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:24:42, skipping insertion in model container [2024-10-14 04:24:42,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:33" (2/3) ... [2024-10-14 04:24:42,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85d3666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:24:42, skipping insertion in model container [2024-10-14 04:24:42,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:42" (3/3) ... [2024-10-14 04:24:42,337 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.03.cil-1.c [2024-10-14 04:24:42,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:24:42,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:24:42,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:24:42,489 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;@66a9bedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:24:42,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:24:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 04:24:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:42,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:42,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:42,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1198396318, now seen corresponding path program 1 times [2024-10-14 04:24:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481062271] [2024-10-14 04:24:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,107 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-14 04:24:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481062271] [2024-10-14 04:24:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481062271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:24:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258079344] [2024-10-14 04:24:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:43,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:24:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:24:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:43,148 INFO L87 Difference]: Start difference. First operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:24:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:44,453 INFO L93 Difference]: Finished difference Result 4754 states and 8887 transitions. [2024-10-14 04:24:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:24:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:44,483 INFO L225 Difference]: With dead ends: 4754 [2024-10-14 04:24:44,483 INFO L226 Difference]: Without dead ends: 2485 [2024-10-14 04:24:44,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:24:44,496 INFO L432 NwaCegarLoop]: 4085 mSDtfsCounter, 4475 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4485 SdHoareTripleChecker+Valid, 16318 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:44,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4485 Valid, 16318 Invalid, 877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:24:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2024-10-14 04:24:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2404. [2024-10-14 04:24:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8379983036471585) internal successors, (4334), 2362 states have internal predecessors, (4334), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-14 04:24:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4397 transitions. [2024-10-14 04:24:44,662 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4397 transitions. Word has length 72 [2024-10-14 04:24:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:44,663 INFO L471 AbstractCegarLoop]: Abstraction has 2404 states and 4397 transitions. [2024-10-14 04:24:44,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:24:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4397 transitions. [2024-10-14 04:24:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:44,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:44,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:24:44,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -934532770, now seen corresponding path program 1 times [2024-10-14 04:24:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179317027] [2024-10-14 04:24:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,897 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-14 04:24:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179317027] [2024-10-14 04:24:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179317027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:44,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:44,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106168289] [2024-10-14 04:24:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:44,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:44,901 INFO L87 Difference]: Start difference. First operand 2404 states and 4397 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:46,417 INFO L93 Difference]: Finished difference Result 2937 states and 5237 transitions. [2024-10-14 04:24:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:24:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:46,431 INFO L225 Difference]: With dead ends: 2937 [2024-10-14 04:24:46,431 INFO L226 Difference]: Without dead ends: 2663 [2024-10-14 04:24:46,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:24:46,434 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 4467 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 20675 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:46,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 20675 Invalid, 1348 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:24:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-14 04:24:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2532. [2024-10-14 04:24:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2467 states have (on average 1.8252938792055127) internal successors, (4503), 2472 states have internal predecessors, (4503), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-14 04:24:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 4592 transitions. [2024-10-14 04:24:46,516 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 4592 transitions. Word has length 72 [2024-10-14 04:24:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:46,517 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 4592 transitions. [2024-10-14 04:24:46,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 4592 transitions. [2024-10-14 04:24:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:46,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:46,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:24:46,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash -373832992, now seen corresponding path program 1 times [2024-10-14 04:24:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971745794] [2024-10-14 04:24:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,689 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-14 04:24:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971745794] [2024-10-14 04:24:46,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971745794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:46,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:46,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:46,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534820732] [2024-10-14 04:24:46,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:46,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:46,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:46,694 INFO L87 Difference]: Start difference. First operand 2532 states and 4592 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:48,003 INFO L93 Difference]: Finished difference Result 3398 states and 5954 transitions. [2024-10-14 04:24:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:24:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:48,021 INFO L225 Difference]: With dead ends: 3398 [2024-10-14 04:24:48,021 INFO L226 Difference]: Without dead ends: 2996 [2024-10-14 04:24:48,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:24:48,026 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 4465 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 20673 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:48,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 20673 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:24:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-10-14 04:24:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2789. [2024-10-14 04:24:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.802680565897245) internal successors, (4842), 2693 states have internal predecessors, (4842), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-14 04:24:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4987 transitions. [2024-10-14 04:24:48,136 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4987 transitions. Word has length 72 [2024-10-14 04:24:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:48,137 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4987 transitions. [2024-10-14 04:24:48,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4987 transitions. [2024-10-14 04:24:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:48,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:48,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:24:48,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash 59896094, now seen corresponding path program 1 times [2024-10-14 04:24:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390217858] [2024-10-14 04:24:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,306 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-14 04:24:48,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390217858] [2024-10-14 04:24:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390217858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:48,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367580125] [2024-10-14 04:24:48,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:48,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:48,309 INFO L87 Difference]: Start difference. First operand 2789 states and 4987 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:48,909 INFO L93 Difference]: Finished difference Result 3643 states and 6340 transitions. [2024-10-14 04:24:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:24:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:48,925 INFO L225 Difference]: With dead ends: 3643 [2024-10-14 04:24:48,925 INFO L226 Difference]: Without dead ends: 2984 [2024-10-14 04:24:48,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:24:48,932 INFO L432 NwaCegarLoop]: 4068 mSDtfsCounter, 4402 mSDsluCounter, 12126 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 16194 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:48,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 16194 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 04:24:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-14 04:24:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2789. [2024-10-14 04:24:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.800819061801936) internal successors, (4837), 2693 states have internal predecessors, (4837), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-14 04:24:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4982 transitions. [2024-10-14 04:24:49,039 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4982 transitions. Word has length 72 [2024-10-14 04:24:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:49,039 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4982 transitions. [2024-10-14 04:24:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4982 transitions. [2024-10-14 04:24:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:49,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:49,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:24:49,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1320813344, now seen corresponding path program 1 times [2024-10-14 04:24:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877814414] [2024-10-14 04:24:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,192 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-14 04:24:49,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877814414] [2024-10-14 04:24:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877814414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359721479] [2024-10-14 04:24:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:49,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:49,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:49,197 INFO L87 Difference]: Start difference. First operand 2789 states and 4982 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:50,505 INFO L93 Difference]: Finished difference Result 4456 states and 7571 transitions. [2024-10-14 04:24:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:24:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:50,524 INFO L225 Difference]: With dead ends: 4456 [2024-10-14 04:24:50,524 INFO L226 Difference]: Without dead ends: 3797 [2024-10-14 04:24:50,528 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-14 04:24:50,529 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4572 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:50,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 20666 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:24:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2024-10-14 04:24:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3300. [2024-10-14 04:24:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3125 states have (on average 1.76384) internal successors, (5512), 3136 states have internal predecessors, (5512), 111 states have call successors, (111), 55 states have call predecessors, (111), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-14 04:24:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5767 transitions. [2024-10-14 04:24:50,681 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5767 transitions. Word has length 72 [2024-10-14 04:24:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5767 transitions. [2024-10-14 04:24:50,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5767 transitions. [2024-10-14 04:24:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:50,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:50,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:24:50,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1361488094, now seen corresponding path program 1 times [2024-10-14 04:24:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285538727] [2024-10-14 04:24:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,855 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-14 04:24:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285538727] [2024-10-14 04:24:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285538727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602127525] [2024-10-14 04:24:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:50,859 INFO L87 Difference]: Start difference. First operand 3300 states and 5767 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:52,093 INFO L93 Difference]: Finished difference Result 6297 states and 10420 transitions. [2024-10-14 04:24:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:24:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:52,118 INFO L225 Difference]: With dead ends: 6297 [2024-10-14 04:24:52,119 INFO L226 Difference]: Without dead ends: 5127 [2024-10-14 04:24:52,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:24:52,127 INFO L432 NwaCegarLoop]: 4168 mSDtfsCounter, 4474 mSDsluCounter, 16494 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 20662 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:52,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 20662 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:24:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2024-10-14 04:24:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4238. [2024-10-14 04:24:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 3923 states have (on average 1.712464950293143) internal successors, (6718), 3942 states have internal predecessors, (6718), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-14 04:24:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7203 transitions. [2024-10-14 04:24:52,400 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 7203 transitions. Word has length 72 [2024-10-14 04:24:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 4238 states and 7203 transitions. [2024-10-14 04:24:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 7203 transitions. [2024-10-14 04:24:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:52,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:52,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:24:52,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:52,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1546693792, now seen corresponding path program 1 times [2024-10-14 04:24:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576218658] [2024-10-14 04:24:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:52,568 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-14 04:24:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:52,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576218658] [2024-10-14 04:24:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576218658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:52,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543668345] [2024-10-14 04:24:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:52,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:52,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:52,573 INFO L87 Difference]: Start difference. First operand 4238 states and 7203 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:53,794 INFO L93 Difference]: Finished difference Result 9417 states and 15228 transitions. [2024-10-14 04:24:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:24:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:53,829 INFO L225 Difference]: With dead ends: 9417 [2024-10-14 04:24:53,829 INFO L226 Difference]: Without dead ends: 7309 [2024-10-14 04:24:53,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:24:53,841 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4462 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 20666 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:24:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2024-10-14 04:24:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 6209. [2024-10-14 04:24:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6209 states, 5622 states have (on average 1.6577730345072927) internal successors, (9320), 5657 states have internal predecessors, (9320), 355 states have call successors, (355), 199 states have call predecessors, (355), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2024-10-14 04:24:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 10303 transitions. [2024-10-14 04:24:54,175 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 10303 transitions. Word has length 72 [2024-10-14 04:24:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:54,175 INFO L471 AbstractCegarLoop]: Abstraction has 6209 states and 10303 transitions. [2024-10-14 04:24:54,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-14 04:24:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 10303 transitions. [2024-10-14 04:24:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 04:24:54,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:54,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:24:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:24:54,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1102793118, now seen corresponding path program 1 times [2024-10-14 04:24:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587538194] [2024-10-14 04:24:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,280 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-14 04:24:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587538194] [2024-10-14 04:24:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587538194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:54,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:24:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784002818] [2024-10-14 04:24:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:54,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:24:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:54,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:24:54,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:54,283 INFO L87 Difference]: Start difference. First operand 6209 states and 10303 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:24:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:55,782 INFO L93 Difference]: Finished difference Result 13635 states and 21859 transitions. [2024-10-14 04:24:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:24:55,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2024-10-14 04:24:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:55,835 INFO L225 Difference]: With dead ends: 13635 [2024-10-14 04:24:55,835 INFO L226 Difference]: Without dead ends: 9557 [2024-10-14 04:24:55,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 04:24:55,872 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 4620 mSDsluCounter, 12266 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 16455 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:55,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 16455 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:24:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2024-10-14 04:24:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 8223. [2024-10-14 04:24:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 7329 states have (on average 1.6159094010096875) internal successors, (11843), 7397 states have internal predecessors, (11843), 544 states have call successors, (544), 301 states have call predecessors, (544), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2024-10-14 04:24:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 13286 transitions. [2024-10-14 04:24:56,608 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 13286 transitions. Word has length 72 [2024-10-14 04:24:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 13286 transitions. [2024-10-14 04:24:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:24:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 13286 transitions. [2024-10-14 04:24:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 04:24:56,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:56,624 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, 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] [2024-10-14 04:24:56,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:24:56,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -342362740, now seen corresponding path program 1 times [2024-10-14 04:24:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:56,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596332194] [2024-10-14 04:24:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:24:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 04:24:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 04:24:56,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:56,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596332194] [2024-10-14 04:24:56,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596332194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297152645] [2024-10-14 04:24:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:56,790 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-14 04:24:56,791 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-14 04:24:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:56,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 04:24:57,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297152645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:57,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:57,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 04:24:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658549333] [2024-10-14 04:24:57,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:57,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:57,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:57,008 INFO L87 Difference]: Start difference. First operand 8223 states and 13286 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 04:24:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:57,688 INFO L93 Difference]: Finished difference Result 20254 states and 31860 transitions. [2024-10-14 04:24:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-14 04:24:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:57,749 INFO L225 Difference]: With dead ends: 20254 [2024-10-14 04:24:57,750 INFO L226 Difference]: Without dead ends: 14162 [2024-10-14 04:24:57,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-14 04:24:57,775 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4346 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-14 04:24:57,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2024-10-14 04:24:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 14108. [2024-10-14 04:24:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 12354 states have (on average 1.5695321353407803) internal successors, (19390), 12487 states have internal predecessors, (19390), 1056 states have call successors, (1056), 601 states have call predecessors, (1056), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2024-10-14 04:24:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 22183 transitions. [2024-10-14 04:24:58,593 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 22183 transitions. Word has length 116 [2024-10-14 04:24:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:58,594 INFO L471 AbstractCegarLoop]: Abstraction has 14108 states and 22183 transitions. [2024-10-14 04:24:58,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 04:24:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 22183 transitions. [2024-10-14 04:24:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 04:24:58,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:58,619 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, 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] [2024-10-14 04:24:58,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 04:24:58,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:58,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:58,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1138616078, now seen corresponding path program 1 times [2024-10-14 04:24:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:58,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302138040] [2024-10-14 04:24:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:24:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:24:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:24:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:24:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:24:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 04:24:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 04:24:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302138040] [2024-10-14 04:24:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302138040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:58,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147100603] [2024-10-14 04:24:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:58,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:58,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:58,938 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-14 04:24:58,939 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-14 04:24:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:59,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 04:24:59,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147100603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 04:24:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332146145] [2024-10-14 04:24:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:59,106 INFO L87 Difference]: Start difference. First operand 14108 states and 22183 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 04:25:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:00,442 INFO L93 Difference]: Finished difference Result 37757 states and 58509 transitions. [2024-10-14 04:25:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:25:00,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-14 04:25:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:00,552 INFO L225 Difference]: With dead ends: 37757 [2024-10-14 04:25:00,552 INFO L226 Difference]: Without dead ends: 25780 [2024-10-14 04:25:00,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-14 04:25:00,595 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4139 SdHoareTripleChecker+Valid, 4346 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:00,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4139 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:25:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25780 states. [2024-10-14 04:25:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25780 to 25676. [2024-10-14 04:25:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25676 states, 22228 states have (on average 1.5367104552816269) internal successors, (34158), 22491 states have internal predecessors, (34158), 2054 states have call successors, (2054), 1201 states have call predecessors, (2054), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2024-10-14 04:25:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25676 states to 25676 states and 39599 transitions. [2024-10-14 04:25:02,359 INFO L78 Accepts]: Start accepts. Automaton has 25676 states and 39599 transitions. Word has length 116 [2024-10-14 04:25:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:02,360 INFO L471 AbstractCegarLoop]: Abstraction has 25676 states and 39599 transitions. [2024-10-14 04:25:02,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 04:25:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25676 states and 39599 transitions. [2024-10-14 04:25:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 04:25:02,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:02,398 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, 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] [2024-10-14 04:25:02,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 04:25:02,602 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,SelfDestructingSolverStorable9 [2024-10-14 04:25:02,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1820104396, now seen corresponding path program 1 times [2024-10-14 04:25:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100443466] [2024-10-14 04:25:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:25:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:25:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:25:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:25:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:25:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:25:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 04:25:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 04:25:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100443466] [2024-10-14 04:25:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100443466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:25:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235429531] [2024-10-14 04:25:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:02,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:25:02,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:25:02,730 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-14 04:25:02,732 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-14 04:25:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:02,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:25:02,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:25:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 04:25:02,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:25:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235429531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:25:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:25:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119234493] [2024-10-14 04:25:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:25:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:25:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:02,870 INFO L87 Difference]: Start difference. First operand 25676 states and 39599 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-14 04:25:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:04,789 INFO L93 Difference]: Finished difference Result 71415 states and 109971 transitions. [2024-10-14 04:25:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:25:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 116 [2024-10-14 04:25:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:04,980 INFO L225 Difference]: With dead ends: 71415 [2024-10-14 04:25:04,980 INFO L226 Difference]: Without dead ends: 47871 [2024-10-14 04:25:05,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-14 04:25:05,043 INFO L432 NwaCegarLoop]: 4338 mSDtfsCounter, 182 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:05,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8500 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:25:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47871 states. [2024-10-14 04:25:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47871 to 47871. [2024-10-14 04:25:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47871 states, 41116 states have (on average 1.5094123942017705) internal successors, (62061), 41572 states have internal predecessors, (62061), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2024-10-14 04:25:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47871 states to 47871 states and 73380 transitions. [2024-10-14 04:25:08,160 INFO L78 Accepts]: Start accepts. Automaton has 47871 states and 73380 transitions. Word has length 116 [2024-10-14 04:25:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 47871 states and 73380 transitions. [2024-10-14 04:25:08,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-14 04:25:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47871 states and 73380 transitions. [2024-10-14 04:25:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 04:25:08,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:08,512 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:08,534 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-14 04:25:08,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:25:08,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:08,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1051187671, now seen corresponding path program 1 times [2024-10-14 04:25:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322376381] [2024-10-14 04:25:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:25:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:25:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:25:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:25:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:25:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:25:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 04:25:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:25:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 04:25:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 04:25:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322376381] [2024-10-14 04:25:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322376381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:25:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470923503] [2024-10-14 04:25:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:08,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:25:08,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:25:08,873 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-14 04:25:08,874 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-14 04:25:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:08,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:25:08,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:25:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 04:25:09,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:25:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470923503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:25:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 04:25:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526241390] [2024-10-14 04:25:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:25:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:25:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:09,124 INFO L87 Difference]: Start difference. First operand 47871 states and 73380 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-14 04:25:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:13,855 INFO L93 Difference]: Finished difference Result 137299 states and 210371 transitions. [2024-10-14 04:25:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:25:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 149 [2024-10-14 04:25:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:14,392 INFO L225 Difference]: With dead ends: 137299 [2024-10-14 04:25:14,392 INFO L226 Difference]: Without dead ends: 91565 [2024-10-14 04:25:14,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 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-14 04:25:14,522 INFO L432 NwaCegarLoop]: 4164 mSDtfsCounter, 4093 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 4349 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 4349 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:25:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91565 states. [2024-10-14 04:25:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91565 to 91161. [2024-10-14 04:25:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91161 states, 78354 states have (on average 1.4957628200219517) internal successors, (117199), 79262 states have internal predecessors, (117199), 7383 states have call successors, (7383), 4655 states have call predecessors, (7383), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2024-10-14 04:25:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91161 states to 91161 states and 138356 transitions. [2024-10-14 04:25:20,166 INFO L78 Accepts]: Start accepts. Automaton has 91161 states and 138356 transitions. Word has length 149 [2024-10-14 04:25:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 91161 states and 138356 transitions. [2024-10-14 04:25:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-14 04:25:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 91161 states and 138356 transitions. [2024-10-14 04:25:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 04:25:20,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:20,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:20,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 04:25:20,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:25:20,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash -404294200, now seen corresponding path program 1 times [2024-10-14 04:25:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398565110] [2024-10-14 04:25:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 04:25:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 04:25:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:25:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 04:25:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 04:25:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 04:25:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:25:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 04:25:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:25:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 04:25:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 04:25:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398565110] [2024-10-14 04:25:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398565110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:25:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552032898] [2024-10-14 04:25:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:25:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:25:20,805 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-14 04:25:20,806 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-14 04:25:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:20,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:25:20,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:25:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 04:25:21,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:25:21,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552032898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:25:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:25:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293549152] [2024-10-14 04:25:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:21,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:25:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:25:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:21,048 INFO L87 Difference]: Start difference. First operand 91161 states and 138356 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)