./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_label41+token_ring.10.cil-2.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_label41+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f17b4934c356e2ce9ba49d61eb1cce33fd0fc691ea6c2b102ce8a7ddd1bdeb11 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:21:44,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:21:44,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:21:44,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:21:44,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:21:44,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:21:44,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:21:44,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:21:44,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:21:44,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:21:44,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:21:44,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:21:44,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:21:44,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:21:44,143 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:21:44,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:21:44,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:21:44,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:21:44,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:21:44,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:21:44,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:21:44,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:21:44,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:21:44,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:21:44,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:21:44,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:21:44,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:21:44,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:21:44,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:21:44,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:21:44,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:21:44,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:21:44,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:21:44,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:21:44,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:21:44,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:21:44,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:21:44,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:21:44,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:21:44,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:21:44,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:21:44,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:21:44,155 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 -> f17b4934c356e2ce9ba49d61eb1cce33fd0fc691ea6c2b102ce8a7ddd1bdeb11 [2024-10-14 04:21:44,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:21:44,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:21:44,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:21:44,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:21:44,449 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:21:44,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.10.cil-2.c [2024-10-14 04:21:45,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:21:46,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:21:46,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.10.cil-2.c [2024-10-14 04:21:46,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcebebde3/680121d4438e409782fe9d6d893c6b62/FLAG267de85f6 [2024-10-14 04:21:46,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcebebde3/680121d4438e409782fe9d6d893c6b62 [2024-10-14 04:21:46,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:21:46,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:21:46,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:21:46,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:21:46,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:21:46,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:46" (1/1) ... [2024-10-14 04:21:46,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769ccfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:46, skipping insertion in model container [2024-10-14 04:21:46,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:46" (1/1) ... [2024-10-14 04:21:46,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:21:48,446 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_label41+token_ring.10.cil-2.c[376251,376264] [2024-10-14 04:21:48,485 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_label41+token_ring.10.cil-2.c[383339,383352] [2024-10-14 04:21:48,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:21:48,727 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:21:49,582 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_label41+token_ring.10.cil-2.c[376251,376264] [2024-10-14 04:21:49,593 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_label41+token_ring.10.cil-2.c[383339,383352] [2024-10-14 04:21:49,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:21:49,677 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:21:49,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49 WrapperNode [2024-10-14 04:21:49,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:21:49,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:21:49,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:21:49,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:21:49,684 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:21:49" (1/1) ... [2024-10-14 04:21:49,768 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:21:49" (1/1) ... [2024-10-14 04:21:50,253 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-10-14 04:21:50,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:21:50,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:21:50,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:21:50,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:21:50,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,432 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:21:50,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:50,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:51,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:21:51,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:21:51,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:21:51,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:21:51,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (1/1) ... [2024-10-14 04:21:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:21:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:21:51,103 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:21:51,122 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:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:21:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:21:51,178 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:21:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:21:51,178 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:21:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:21:51,179 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:21:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:21:51,179 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:21:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:21:51,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:21:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:21:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:21:51,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:21:51,339 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:21:51,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:21:59,073 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-10-14 04:21:59,073 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:21:59,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:21:59,203 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-14 04:21:59,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:21:59 BoogieIcfgContainer [2024-10-14 04:21:59,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:21:59,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:21:59,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:21:59,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:21:59,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:21:46" (1/3) ... [2024-10-14 04:21:59,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c8bb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:21:59, skipping insertion in model container [2024-10-14 04:21:59,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:49" (2/3) ... [2024-10-14 04:21:59,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c8bb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:21:59, skipping insertion in model container [2024-10-14 04:21:59,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:21:59" (3/3) ... [2024-10-14 04:21:59,214 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.10.cil-2.c [2024-10-14 04:21:59,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:21:59,231 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:21:59,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:21:59,363 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;@323278e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:21:59,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:21:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 04:21:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:21:59,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:59,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:59,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1401539103, now seen corresponding path program 1 times [2024-10-14 04:21:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:59,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765075719] [2024-10-14 04:21:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:21:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:00,142 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:22:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765075719] [2024-10-14 04:22:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765075719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:22:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324867092] [2024-10-14 04:22:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:22:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:22:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:22:00,181 INFO L87 Difference]: Start difference. First operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:01,899 INFO L93 Difference]: Finished difference Result 4952 states and 9258 transitions. [2024-10-14 04:22:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:22:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:01,937 INFO L225 Difference]: With dead ends: 4952 [2024-10-14 04:22:01,938 INFO L226 Difference]: Without dead ends: 2531 [2024-10-14 04:22:01,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:22:01,956 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 837 mSDsluCounter, 12160 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 16379 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:01,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 16379 Invalid, 963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:22:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-14 04:22:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2421. [2024-10-14 04:22:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2389 states have (on average 1.8396818752616158) internal successors, (4395), 2391 states have internal predecessors, (4395), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 04:22:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4443 transitions. [2024-10-14 04:22:02,117 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4443 transitions. Word has length 141 [2024-10-14 04:22:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4443 transitions. [2024-10-14 04:22:02,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4443 transitions. [2024-10-14 04:22:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:02,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:02,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:02,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:22:02,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash 726378977, now seen corresponding path program 1 times [2024-10-14 04:22:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:02,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31600724] [2024-10-14 04:22:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:02,515 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:22:02,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31600724] [2024-10-14 04:22:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31600724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355507675] [2024-10-14 04:22:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:02,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:02,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:02,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:02,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:02,519 INFO L87 Difference]: Start difference. First operand 2421 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:06,552 INFO L93 Difference]: Finished difference Result 3245 states and 5826 transitions. [2024-10-14 04:22:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:06,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:06,570 INFO L225 Difference]: With dead ends: 3245 [2024-10-14 04:22:06,570 INFO L226 Difference]: Without dead ends: 2961 [2024-10-14 04:22:06,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:06,575 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5163 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 21516 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:06,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 21516 Invalid, 3364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 04:22:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-10-14 04:22:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2724. [2024-10-14 04:22:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2663 states have (on average 1.819752159218926) internal successors, (4846), 2667 states have internal predecessors, (4846), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-14 04:22:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4943 transitions. [2024-10-14 04:22:06,701 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4943 transitions. Word has length 141 [2024-10-14 04:22:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:06,701 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4943 transitions. [2024-10-14 04:22:06,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4943 transitions. [2024-10-14 04:22:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:06,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:06,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:22:06,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:06,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1214426083, now seen corresponding path program 1 times [2024-10-14 04:22:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138450615] [2024-10-14 04:22:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:07,081 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:22:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138450615] [2024-10-14 04:22:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138450615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210901495] [2024-10-14 04:22:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:07,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:07,085 INFO L87 Difference]: Start difference. First operand 2724 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:10,491 INFO L93 Difference]: Finished difference Result 4288 states and 7546 transitions. [2024-10-14 04:22:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:10,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:10,510 INFO L225 Difference]: With dead ends: 4288 [2024-10-14 04:22:10,510 INFO L226 Difference]: Without dead ends: 3703 [2024-10-14 04:22:10,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:10,518 INFO L432 NwaCegarLoop]: 4311 mSDtfsCounter, 5204 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 21400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:10,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 21400 Invalid, 3059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 04:22:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-10-14 04:22:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3278. [2024-10-14 04:22:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7873617693522907) internal successors, (5657), 3171 states have internal predecessors, (5657), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-14 04:22:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5840 transitions. [2024-10-14 04:22:10,661 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5840 transitions. Word has length 141 [2024-10-14 04:22:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:10,662 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5840 transitions. [2024-10-14 04:22:10,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5840 transitions. [2024-10-14 04:22:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:10,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:10,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:22:10,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 121790881, now seen corresponding path program 1 times [2024-10-14 04:22:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090759039] [2024-10-14 04:22:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,971 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:22:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090759039] [2024-10-14 04:22:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090759039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925249701] [2024-10-14 04:22:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:10,975 INFO L87 Difference]: Start difference. First operand 3278 states and 5840 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:12,543 INFO L93 Difference]: Finished difference Result 4857 states and 8484 transitions. [2024-10-14 04:22:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:12,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:12,562 INFO L225 Difference]: With dead ends: 4857 [2024-10-14 04:22:12,562 INFO L226 Difference]: Without dead ends: 3716 [2024-10-14 04:22:12,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:12,572 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 5000 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:12,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 16573 Invalid, 1560 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:22:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2024-10-14 04:22:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3278. [2024-10-14 04:22:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.785781990521327) internal successors, (5652), 3171 states have internal predecessors, (5652), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-14 04:22:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5835 transitions. [2024-10-14 04:22:12,694 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5835 transitions. Word has length 141 [2024-10-14 04:22:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:12,695 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5835 transitions. [2024-10-14 04:22:12,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5835 transitions. [2024-10-14 04:22:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:12,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:12,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:22:12,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1160381405, now seen corresponding path program 1 times [2024-10-14 04:22:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312838594] [2024-10-14 04:22:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,933 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:22:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:12,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312838594] [2024-10-14 04:22:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312838594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:12,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:12,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82803713] [2024-10-14 04:22:12,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:12,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:12,942 INFO L87 Difference]: Start difference. First operand 3278 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:14,221 INFO L93 Difference]: Finished difference Result 4853 states and 8463 transitions. [2024-10-14 04:22:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:14,238 INFO L225 Difference]: With dead ends: 4853 [2024-10-14 04:22:14,239 INFO L226 Difference]: Without dead ends: 3712 [2024-10-14 04:22:14,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:14,245 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4998 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:14,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5016 Valid, 16573 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:22:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-14 04:22:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3278. [2024-10-14 04:22:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7842022116903633) internal successors, (5647), 3171 states have internal predecessors, (5647), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-14 04:22:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5830 transitions. [2024-10-14 04:22:14,371 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5830 transitions. Word has length 141 [2024-10-14 04:22:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5830 transitions. [2024-10-14 04:22:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5830 transitions. [2024-10-14 04:22:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:14,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:14,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:22:14,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:14,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1292110177, now seen corresponding path program 1 times [2024-10-14 04:22:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586301253] [2024-10-14 04:22:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,617 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:22:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586301253] [2024-10-14 04:22:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586301253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728728551] [2024-10-14 04:22:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:14,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:14,621 INFO L87 Difference]: Start difference. First operand 3278 states and 5830 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:16,111 INFO L93 Difference]: Finished difference Result 4848 states and 8440 transitions. [2024-10-14 04:22:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:16,123 INFO L225 Difference]: With dead ends: 4848 [2024-10-14 04:22:16,123 INFO L226 Difference]: Without dead ends: 3707 [2024-10-14 04:22:16,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:16,127 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4867 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:16,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 20671 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:22:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-14 04:22:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3278. [2024-10-14 04:22:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7826224328593996) internal successors, (5642), 3171 states have internal predecessors, (5642), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-14 04:22:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5825 transitions. [2024-10-14 04:22:16,245 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5825 transitions. Word has length 141 [2024-10-14 04:22:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:16,245 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5825 transitions. [2024-10-14 04:22:16,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5825 transitions. [2024-10-14 04:22:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:16,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:16,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:22:16,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash -429892509, now seen corresponding path program 1 times [2024-10-14 04:22:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114621315] [2024-10-14 04:22:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:16,495 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:22:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114621315] [2024-10-14 04:22:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114621315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882231075] [2024-10-14 04:22:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:16,498 INFO L87 Difference]: Start difference. First operand 3278 states and 5825 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:19,580 INFO L93 Difference]: Finished difference Result 6307 states and 10801 transitions. [2024-10-14 04:22:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:19,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:19,607 INFO L225 Difference]: With dead ends: 6307 [2024-10-14 04:22:19,607 INFO L226 Difference]: Without dead ends: 5168 [2024-10-14 04:22:19,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:19,621 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5154 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:19,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 21511 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 04:22:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2024-10-14 04:22:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 4397. [2024-10-14 04:22:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7375598086124402) internal successors, (7263), 4190 states have internal predecessors, (7263), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-14 04:22:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7624 transitions. [2024-10-14 04:22:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7624 transitions. Word has length 141 [2024-10-14 04:22:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7624 transitions. [2024-10-14 04:22:19,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7624 transitions. [2024-10-14 04:22:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:19,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:19,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:19,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:22:19,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:19,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash -762535647, now seen corresponding path program 1 times [2024-10-14 04:22:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:19,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87595818] [2024-10-14 04:22:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:20,239 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:22:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87595818] [2024-10-14 04:22:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87595818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284670309] [2024-10-14 04:22:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:20,242 INFO L87 Difference]: Start difference. First operand 4397 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:22,066 INFO L93 Difference]: Finished difference Result 7464 states and 12699 transitions. [2024-10-14 04:22:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:22,089 INFO L225 Difference]: With dead ends: 7464 [2024-10-14 04:22:22,089 INFO L226 Difference]: Without dead ends: 5204 [2024-10-14 04:22:22,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:22,100 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4871 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:22,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 20671 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:22:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-10-14 04:22:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4397. [2024-10-14 04:22:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7354066985645933) internal successors, (7254), 4190 states have internal predecessors, (7254), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-14 04:22:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7615 transitions. [2024-10-14 04:22:22,327 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7615 transitions. Word has length 141 [2024-10-14 04:22:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:22,329 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7615 transitions. [2024-10-14 04:22:22,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7615 transitions. [2024-10-14 04:22:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:22,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:22,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:22:22,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1166396579, now seen corresponding path program 1 times [2024-10-14 04:22:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413000506] [2024-10-14 04:22:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:22,581 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:22:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413000506] [2024-10-14 04:22:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413000506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919746015] [2024-10-14 04:22:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:22,584 INFO L87 Difference]: Start difference. First operand 4397 states and 7615 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:25,678 INFO L93 Difference]: Finished difference Result 10354 states and 17366 transitions. [2024-10-14 04:22:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:25,704 INFO L225 Difference]: With dead ends: 10354 [2024-10-14 04:22:25,705 INFO L226 Difference]: Without dead ends: 8096 [2024-10-14 04:22:25,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:25,715 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5186 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:25,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 21511 Invalid, 3142 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 04:22:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2024-10-14 04:22:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6657. [2024-10-14 04:22:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6232 states have (on average 1.6882220795892169) internal successors, (10521), 6250 states have internal predecessors, (10521), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-14 04:22:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 11256 transitions. [2024-10-14 04:22:26,043 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 11256 transitions. Word has length 141 [2024-10-14 04:22:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 11256 transitions. [2024-10-14 04:22:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 11256 transitions. [2024-10-14 04:22:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:26,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:26,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:26,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:22:26,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1401425755, now seen corresponding path program 1 times [2024-10-14 04:22:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25984883] [2024-10-14 04:22:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,277 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:22:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25984883] [2024-10-14 04:22:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25984883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579581439] [2024-10-14 04:22:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:26,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:26,279 INFO L87 Difference]: Start difference. First operand 6657 states and 11256 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:29,269 INFO L93 Difference]: Finished difference Result 18478 states and 30647 transitions. [2024-10-14 04:22:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:29,320 INFO L225 Difference]: With dead ends: 18478 [2024-10-14 04:22:29,321 INFO L226 Difference]: Without dead ends: 13960 [2024-10-14 04:22:29,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:29,340 INFO L432 NwaCegarLoop]: 4312 mSDtfsCounter, 5212 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:29,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21401 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:22:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13960 states. [2024-10-14 04:22:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13960 to 11193. [2024-10-14 04:22:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 10352 states have (on average 1.6498261205564142) internal successors, (17079), 10386 states have internal predecessors, (17079), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-14 04:22:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 18616 transitions. [2024-10-14 04:22:29,958 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 18616 transitions. Word has length 141 [2024-10-14 04:22:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:29,958 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 18616 transitions. [2024-10-14 04:22:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 18616 transitions. [2024-10-14 04:22:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:29,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:29,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:22:29,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -930069405, now seen corresponding path program 1 times [2024-10-14 04:22:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046964196] [2024-10-14 04:22:29,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:30,189 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:22:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046964196] [2024-10-14 04:22:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046964196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500660765] [2024-10-14 04:22:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:30,192 INFO L87 Difference]: Start difference. First operand 11193 states and 18616 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:34,683 INFO L93 Difference]: Finished difference Result 38822 states and 64027 transitions. [2024-10-14 04:22:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:34,801 INFO L225 Difference]: With dead ends: 38822 [2024-10-14 04:22:34,802 INFO L226 Difference]: Without dead ends: 29768 [2024-10-14 04:22:34,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:34,836 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5552 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5580 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:34,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5580 Valid, 21505 Invalid, 3114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:22:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29768 states. [2024-10-14 04:22:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29768 to 20233. [2024-10-14 04:22:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20233 states, 18592 states have (on average 1.6249462134251291) internal successors, (30211), 18658 states have internal predecessors, (30211), 1191 states have call successors, (1191), 384 states have call predecessors, (1191), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-14 04:22:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 33450 transitions. [2024-10-14 04:22:36,144 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 33450 transitions. Word has length 141 [2024-10-14 04:22:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:36,144 INFO L471 AbstractCegarLoop]: Abstraction has 20233 states and 33450 transitions. [2024-10-14 04:22:36,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 33450 transitions. [2024-10-14 04:22:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:36,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:36,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:36,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:22:36,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1717534949, now seen corresponding path program 1 times [2024-10-14 04:22:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295977583] [2024-10-14 04:22:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:36,372 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:22:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295977583] [2024-10-14 04:22:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295977583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50582695] [2024-10-14 04:22:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:36,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:36,374 INFO L87 Difference]: Start difference. First operand 20233 states and 33450 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:41,991 INFO L93 Difference]: Finished difference Result 74518 states and 123319 transitions. [2024-10-14 04:22:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:42,211 INFO L225 Difference]: With dead ends: 74518 [2024-10-14 04:22:42,212 INFO L226 Difference]: Without dead ends: 56424 [2024-10-14 04:22:42,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:42,276 INFO L432 NwaCegarLoop]: 4354 mSDtfsCounter, 5271 mSDsluCounter, 17145 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 21499 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:42,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 21499 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 04:22:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2024-10-14 04:22:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 37993. [2024-10-14 04:22:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37993 states, 34784 states have (on average 1.610711821527139) internal successors, (56027), 34914 states have internal predecessors, (56027), 2311 states have call successors, (2311), 768 states have call predecessors, (2311), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-14 04:22:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 63092 transitions. [2024-10-14 04:22:45,163 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 63092 transitions. Word has length 141 [2024-10-14 04:22:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 37993 states and 63092 transitions. [2024-10-14 04:22:45,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 63092 transitions. [2024-10-14 04:22:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 04:22:45,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:45,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:45,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:22:45,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash -413815773, now seen corresponding path program 1 times [2024-10-14 04:22:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154984704] [2024-10-14 04:22:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 04:22:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 04:22:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 04:22:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 04:22:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,397 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:22:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154984704] [2024-10-14 04:22:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154984704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217885763] [2024-10-14 04:22:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:45,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:45,400 INFO L87 Difference]: Start difference. First operand 37993 states and 63092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:22:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:54,374 INFO L93 Difference]: Finished difference Result 144054 states and 240647 transitions. [2024-10-14 04:22:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-14 04:22:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:55,086 INFO L225 Difference]: With dead ends: 144054 [2024-10-14 04:22:55,086 INFO L226 Difference]: Without dead ends: 108200 [2024-10-14 04:22:55,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:55,214 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5484 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5512 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:55,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5512 Valid, 21505 Invalid, 3088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3021 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]