./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.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 8321a367d25b54b23b2762d5ecbfeee51530317d33e488964270d878a9001f5b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 03:27:28,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 03:27:28,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 03:27:28,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 03:27:28,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 03:27:28,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 03:27:28,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 03:27:28,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 03:27:28,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 03:27:28,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 03:27:28,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 03:27:28,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 03:27:28,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 03:27:28,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 03:27:28,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 03:27:28,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 03:27:28,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 03:27:28,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 03:27:28,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 03:27:28,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 03:27:28,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 03:27:28,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 03:27:28,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 03:27:28,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 03:27:28,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 03:27:28,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 03:27:28,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 03:27:28,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 03:27:28,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 03:27:28,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 03:27:28,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 03:27:28,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 03:27:28,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:27:28,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 03:27:28,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 03:27:28,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 03:27:28,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 03:27:28,323 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 -> 8321a367d25b54b23b2762d5ecbfeee51530317d33e488964270d878a9001f5b [2024-11-22 03:27:28,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 03:27:28,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 03:27:28,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 03:27:28,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 03:27:28,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 03:27:28,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c [2024-11-22 03:27:29,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 03:27:30,451 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 03:27:30,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c [2024-11-22 03:27:30,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb0f7b14/74597e813ff84655ad2dd573d7cc6151/FLAGb8f8ceb33 [2024-11-22 03:27:30,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb0f7b14/74597e813ff84655ad2dd573d7cc6151 [2024-11-22 03:27:30,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 03:27:30,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 03:27:30,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 03:27:30,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 03:27:30,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 03:27:30,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:27:30" (1/1) ... [2024-11-22 03:27:30,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0dfe76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:30, skipping insertion in model container [2024-11-22 03:27:30,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:27:30" (1/1) ... [2024-11-22 03:27:31,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 03:27:32,429 WARN L250 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_label47+token_ring.06.cil-2.c[377612,377625] [2024-11-22 03:27:32,458 WARN L250 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_label47+token_ring.06.cil-2.c[383339,383352] [2024-11-22 03:27:32,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:27:32,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 03:27:33,220 WARN L250 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_label47+token_ring.06.cil-2.c[377612,377625] [2024-11-22 03:27:33,229 WARN L250 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_label47+token_ring.06.cil-2.c[383339,383352] [2024-11-22 03:27:33,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:27:33,298 INFO L204 MainTranslator]: Completed translation [2024-11-22 03:27:33,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33 WrapperNode [2024-11-22 03:27:33,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 03:27:33,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 03:27:33,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 03:27:33,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 03:27:33,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,700 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-11-22 03:27:33,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 03:27:33,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 03:27:33,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 03:27:33,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 03:27:33,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,960 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-11-22 03:27:33,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:33,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 03:27:34,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 03:27:34,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 03:27:34,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 03:27:34,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (1/1) ... [2024-11-22 03:27:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:27:34,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:27:34,301 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-11-22 03:27:34,373 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-11-22 03:27:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 03:27:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-22 03:27:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-22 03:27:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-22 03:27:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-22 03:27:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-22 03:27:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-22 03:27:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-22 03:27:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 03:27:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 03:27:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 03:27:34,504 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 03:27:34,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 03:27:40,658 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-11-22 03:27:40,658 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 03:27:40,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 03:27:40,701 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-22 03:27:40,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:27:40 BoogieIcfgContainer [2024-11-22 03:27:40,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 03:27:40,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 03:27:40,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 03:27:40,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 03:27:40,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 03:27:30" (1/3) ... [2024-11-22 03:27:40,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278509d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:27:40, skipping insertion in model container [2024-11-22 03:27:40,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:27:33" (2/3) ... [2024-11-22 03:27:40,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278509d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:27:40, skipping insertion in model container [2024-11-22 03:27:40,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:27:40" (3/3) ... [2024-11-22 03:27:40,708 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.06.cil-2.c [2024-11-22 03:27:40,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 03:27:40,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 03:27:40,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 03:27:40,830 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;@6094f36c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 03:27:40,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 03:27:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 2422 states, 2393 states have (on average 1.8487254492269118) internal successors, (4424), 2396 states have internal predecessors, (4424), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 03:27:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:40,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:40,858 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] [2024-11-22 03:27:40,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:40,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -603322071, now seen corresponding path program 1 times [2024-11-22 03:27:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317748744] [2024-11-22 03:27:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317748744] [2024-11-22 03:27:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317748744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:41,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:41,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:27:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554620411] [2024-11-22 03:27:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:41,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:27:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:27:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:27:41,173 INFO L87 Difference]: Start difference. First operand has 2422 states, 2393 states have (on average 1.8487254492269118) internal successors, (4424), 2396 states have internal predecessors, (4424), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:41,335 INFO L93 Difference]: Finished difference Result 4834 states and 8909 transitions. [2024-11-22 03:27:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:27:41,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 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 112 [2024-11-22 03:27:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:41,369 INFO L225 Difference]: With dead ends: 4834 [2024-11-22 03:27:41,370 INFO L226 Difference]: Without dead ends: 2355 [2024-11-22 03:27:41,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:27:41,382 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 350 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 8403 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:41,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 8403 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 03:27:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2024-11-22 03:27:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2355. [2024-11-22 03:27:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2327 states have (on average 1.8362698753760207) internal successors, (4273), 2329 states have internal predecessors, (4273), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 03:27:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 4313 transitions. [2024-11-22 03:27:41,514 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 4313 transitions. Word has length 112 [2024-11-22 03:27:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:41,516 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 4313 transitions. [2024-11-22 03:27:41,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 4313 transitions. [2024-11-22 03:27:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:41,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:41,521 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] [2024-11-22 03:27:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 03:27:41,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:41,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1634362969, now seen corresponding path program 1 times [2024-11-22 03:27:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29274370] [2024-11-22 03:27:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:41,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29274370] [2024-11-22 03:27:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29274370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094904950] [2024-11-22 03:27:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:41,787 INFO L87 Difference]: Start difference. First operand 2355 states and 4313 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:42,342 INFO L93 Difference]: Finished difference Result 2835 states and 5064 transitions. [2024-11-22 03:27:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:42,359 INFO L225 Difference]: With dead ends: 2835 [2024-11-22 03:27:42,360 INFO L226 Difference]: Without dead ends: 2615 [2024-11-22 03:27:42,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:42,363 INFO L432 NwaCegarLoop]: 4424 mSDtfsCounter, 4603 mSDsluCounter, 13357 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 17781 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:42,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4617 Valid, 17781 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2024-11-22 03:27:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2585. [2024-11-22 03:27:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2532 states have (on average 1.8131911532385465) internal successors, (4591), 2536 states have internal predecessors, (4591), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-22 03:27:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4672 transitions. [2024-11-22 03:27:42,427 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4672 transitions. Word has length 112 [2024-11-22 03:27:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:42,428 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 4672 transitions. [2024-11-22 03:27:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4672 transitions. [2024-11-22 03:27:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:42,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:42,430 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] [2024-11-22 03:27:42,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 03:27:42,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1041629413, now seen corresponding path program 1 times [2024-11-22 03:27:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982056908] [2024-11-22 03:27:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982056908] [2024-11-22 03:27:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982056908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:42,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:42,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552124300] [2024-11-22 03:27:42,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:42,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:42,597 INFO L87 Difference]: Start difference. First operand 2585 states and 4672 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:43,119 INFO L93 Difference]: Finished difference Result 3524 states and 6140 transitions. [2024-11-22 03:27:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:43,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:43,131 INFO L225 Difference]: With dead ends: 3524 [2024-11-22 03:27:43,131 INFO L226 Difference]: Without dead ends: 3076 [2024-11-22 03:27:43,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:43,134 INFO L432 NwaCegarLoop]: 4364 mSDtfsCounter, 4599 mSDsluCounter, 13206 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4613 SdHoareTripleChecker+Valid, 17570 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:43,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4613 Valid, 17570 Invalid, 693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2024-11-22 03:27:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3035. [2024-11-22 03:27:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 2936 states have (on average 1.7758855585831064) internal successors, (5214), 2944 states have internal predecessors, (5214), 67 states have call successors, (67), 24 states have call predecessors, (67), 30 states have return successors, (90), 70 states have call predecessors, (90), 67 states have call successors, (90) [2024-11-22 03:27:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 5371 transitions. [2024-11-22 03:27:43,207 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 5371 transitions. Word has length 112 [2024-11-22 03:27:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:43,208 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 5371 transitions. [2024-11-22 03:27:43,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 5371 transitions. [2024-11-22 03:27:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:43,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:43,210 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] [2024-11-22 03:27:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 03:27:43,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 158120423, now seen corresponding path program 1 times [2024-11-22 03:27:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068511033] [2024-11-22 03:27:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068511033] [2024-11-22 03:27:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068511033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354876776] [2024-11-22 03:27:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:43,301 INFO L87 Difference]: Start difference. First operand 3035 states and 5371 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:43,806 INFO L93 Difference]: Finished difference Result 4963 states and 8421 transitions. [2024-11-22 03:27:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:43,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:43,821 INFO L225 Difference]: With dead ends: 4963 [2024-11-22 03:27:43,821 INFO L226 Difference]: Without dead ends: 4065 [2024-11-22 03:27:43,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:43,827 INFO L432 NwaCegarLoop]: 4416 mSDtfsCounter, 4593 mSDsluCounter, 13321 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4607 SdHoareTripleChecker+Valid, 17737 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4607 Valid, 17737 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2024-11-22 03:27:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 4003. [2024-11-22 03:27:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 3806 states have (on average 1.7277982133473464) internal successors, (6576), 3828 states have internal predecessors, (6576), 127 states have call successors, (127), 48 states have call predecessors, (127), 68 states have return successors, (206), 134 states have call predecessors, (206), 127 states have call successors, (206) [2024-11-22 03:27:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 6909 transitions. [2024-11-22 03:27:43,952 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 6909 transitions. Word has length 112 [2024-11-22 03:27:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:43,952 INFO L471 AbstractCegarLoop]: Abstraction has 4003 states and 6909 transitions. [2024-11-22 03:27:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 6909 transitions. [2024-11-22 03:27:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:43,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:43,955 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] [2024-11-22 03:27:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 03:27:43,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 129620133, now seen corresponding path program 1 times [2024-11-22 03:27:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055806837] [2024-11-22 03:27:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055806837] [2024-11-22 03:27:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055806837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617281043] [2024-11-22 03:27:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:44,077 INFO L87 Difference]: Start difference. First operand 4003 states and 6909 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:44,614 INFO L93 Difference]: Finished difference Result 8094 states and 13531 transitions. [2024-11-22 03:27:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:44,640 INFO L225 Difference]: With dead ends: 8094 [2024-11-22 03:27:44,640 INFO L226 Difference]: Without dead ends: 6228 [2024-11-22 03:27:44,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:44,650 INFO L432 NwaCegarLoop]: 4415 mSDtfsCounter, 4588 mSDsluCounter, 13313 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 17728 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:44,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 17728 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6228 states. [2024-11-22 03:27:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6228 to 6127. [2024-11-22 03:27:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6127 states, 5716 states have (on average 1.6826452064380686) internal successors, (9618), 5784 states have internal predecessors, (9618), 247 states have call successors, (247), 96 states have call predecessors, (247), 162 states have return successors, (534), 262 states have call predecessors, (534), 247 states have call successors, (534) [2024-11-22 03:27:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 10399 transitions. [2024-11-22 03:27:44,999 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 10399 transitions. Word has length 112 [2024-11-22 03:27:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:45,000 INFO L471 AbstractCegarLoop]: Abstraction has 6127 states and 10399 transitions. [2024-11-22 03:27:45,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 10399 transitions. [2024-11-22 03:27:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:45,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:45,005 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] [2024-11-22 03:27:45,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 03:27:45,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1810961881, now seen corresponding path program 1 times [2024-11-22 03:27:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873083203] [2024-11-22 03:27:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873083203] [2024-11-22 03:27:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873083203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206433239] [2024-11-22 03:27:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:45,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:45,133 INFO L87 Difference]: Start difference. First operand 6127 states and 10399 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:45,900 INFO L93 Difference]: Finished difference Result 15049 states and 25389 transitions. [2024-11-22 03:27:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:45,971 INFO L225 Difference]: With dead ends: 15049 [2024-11-22 03:27:45,972 INFO L226 Difference]: Without dead ends: 11059 [2024-11-22 03:27:45,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:45,992 INFO L432 NwaCegarLoop]: 4412 mSDtfsCounter, 4583 mSDsluCounter, 13297 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17709 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:45,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17709 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11059 states. [2024-11-22 03:27:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11059 to 10887. [2024-11-22 03:27:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 9994 states have (on average 1.6565939563738243) internal successors, (16556), 10208 states have internal predecessors, (16556), 487 states have call successors, (487), 192 states have call predecessors, (487), 404 states have return successors, (1574), 518 states have call predecessors, (1574), 487 states have call successors, (1574) [2024-11-22 03:27:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 18617 transitions. [2024-11-22 03:27:46,550 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 18617 transitions. Word has length 112 [2024-11-22 03:27:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:46,550 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 18617 transitions. [2024-11-22 03:27:46,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 18617 transitions. [2024-11-22 03:27:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:46,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:46,559 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] [2024-11-22 03:27:46,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 03:27:46,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:46,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash 66101349, now seen corresponding path program 1 times [2024-11-22 03:27:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915844986] [2024-11-22 03:27:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915844986] [2024-11-22 03:27:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915844986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35697275] [2024-11-22 03:27:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:46,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:46,671 INFO L87 Difference]: Start difference. First operand 10887 states and 18617 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:47,498 INFO L93 Difference]: Finished difference Result 30832 states and 54099 transitions. [2024-11-22 03:27:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:47,598 INFO L225 Difference]: With dead ends: 30832 [2024-11-22 03:27:47,599 INFO L226 Difference]: Without dead ends: 22082 [2024-11-22 03:27:47,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:47,649 INFO L432 NwaCegarLoop]: 4409 mSDtfsCounter, 4578 mSDsluCounter, 13284 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 17693 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:47,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 17693 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22082 states. [2024-11-22 03:27:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22082 to 21783. [2024-11-22 03:27:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21783 states, 19764 states have (on average 1.653612629022465) internal successors, (32682), 20432 states have internal predecessors, (32682), 967 states have call successors, (967), 384 states have call predecessors, (967), 1050 states have return successors, (5190), 1030 states have call predecessors, (5190), 967 states have call successors, (5190) [2024-11-22 03:27:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 38839 transitions. [2024-11-22 03:27:48,707 INFO L78 Accepts]: Start accepts. Automaton has 21783 states and 38839 transitions. Word has length 112 [2024-11-22 03:27:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 21783 states and 38839 transitions. [2024-11-22 03:27:48,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 21783 states and 38839 transitions. [2024-11-22 03:27:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:48,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:48,718 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] [2024-11-22 03:27:48,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 03:27:48,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash -704632217, now seen corresponding path program 1 times [2024-11-22 03:27:48,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:48,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008787090] [2024-11-22 03:27:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008787090] [2024-11-22 03:27:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008787090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898225964] [2024-11-22 03:27:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:48,805 INFO L87 Difference]: Start difference. First operand 21783 states and 38839 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:50,379 INFO L93 Difference]: Finished difference Result 70395 states and 131730 transitions. [2024-11-22 03:27:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:50,631 INFO L225 Difference]: With dead ends: 70395 [2024-11-22 03:27:50,631 INFO L226 Difference]: Without dead ends: 50749 [2024-11-22 03:27:50,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:50,715 INFO L432 NwaCegarLoop]: 4405 mSDtfsCounter, 4767 mSDsluCounter, 13261 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4788 SdHoareTripleChecker+Valid, 17666 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:50,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4788 Valid, 17666 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50749 states. [2024-11-22 03:27:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50749 to 47027. [2024-11-22 03:27:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47027 states, 42334 states have (on average 1.6677847592951291) internal successors, (70604), 44396 states have internal predecessors, (70604), 1863 states have call successors, (1863), 768 states have call predecessors, (1863), 2828 states have return successors, (18502), 1990 states have call predecessors, (18502), 1863 states have call successors, (18502) [2024-11-22 03:27:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47027 states to 47027 states and 90969 transitions. [2024-11-22 03:27:53,312 INFO L78 Accepts]: Start accepts. Automaton has 47027 states and 90969 transitions. Word has length 112 [2024-11-22 03:27:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:27:53,313 INFO L471 AbstractCegarLoop]: Abstraction has 47027 states and 90969 transitions. [2024-11-22 03:27:53,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 47027 states and 90969 transitions. [2024-11-22 03:27:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:27:53,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:27:53,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 03:27:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 03:27:53,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:27:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:27:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1699325915, now seen corresponding path program 1 times [2024-11-22 03:27:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:27:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836815371] [2024-11-22 03:27:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:27:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:27:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:27:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:27:53,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:27:53,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836815371] [2024-11-22 03:27:53,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836815371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:27:53,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:27:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:27:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534984129] [2024-11-22 03:27:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:27:53,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:27:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:27:53,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:27:53,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:27:53,421 INFO L87 Difference]: Start difference. First operand 47027 states and 90969 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:27:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:27:57,130 INFO L93 Difference]: Finished difference Result 154887 states and 325330 transitions. [2024-11-22 03:27:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 03:27:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 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 112 [2024-11-22 03:27:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:27:57,682 INFO L225 Difference]: With dead ends: 154887 [2024-11-22 03:27:57,683 INFO L226 Difference]: Without dead ends: 109997 [2024-11-22 03:27:57,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:27:57,796 INFO L432 NwaCegarLoop]: 4402 mSDtfsCounter, 4699 mSDsluCounter, 13241 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 17643 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:27:57,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 17643 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:27:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109997 states. [2024-11-22 03:28:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109997 to 104613. [2024-11-22 03:28:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104613 states, 93178 states have (on average 1.6791731953894695) internal successors, (156462), 99486 states have internal predecessors, (156462), 3591 states have call successors, (3591), 1536 states have call predecessors, (3591), 7842 states have return successors, (69638), 3846 states have call predecessors, (69638), 3591 states have call successors, (69638) [2024-11-22 03:28:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104613 states to 104613 states and 229691 transitions. [2024-11-22 03:28:06,119 INFO L78 Accepts]: Start accepts. Automaton has 104613 states and 229691 transitions. Word has length 112 [2024-11-22 03:28:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:28:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 104613 states and 229691 transitions. [2024-11-22 03:28:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 03:28:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 104613 states and 229691 transitions. [2024-11-22 03:28:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 03:28:06,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:28:06,159 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] [2024-11-22 03:28:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 03:28:06,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:28:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:28:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 637066595, now seen corresponding path program 1 times [2024-11-22 03:28:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:28:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094408357] [2024-11-22 03:28:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:28:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:28:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:28:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:28:06,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:28:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094408357] [2024-11-22 03:28:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094408357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:28:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:28:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 03:28:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823674391] [2024-11-22 03:28:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:28:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:28:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:28:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:28:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:28:06,248 INFO L87 Difference]: Start difference. First operand 104613 states and 229691 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)