./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_label45+token_ring.09.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 b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:34:15,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:34:15,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:34:15,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:34:15,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:34:15,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:34:15,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:34:15,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:34:15,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:34:15,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:34:15,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:34:15,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:34:15,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:34:15,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:34:15,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:34:15,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:34:15,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:34:15,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:34:15,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:34:15,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:34:15,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:34:15,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:34:15,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:34:15,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:34:15,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:34:15,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:34:15,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:34:15,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:34:15,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:34:15,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:34:15,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:34:15,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:34:15,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:34:15,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:34:15,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:34:15,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:34:15,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:34:15,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:34:15,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:34:15,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:34:15,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:34:15,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:34:15,757 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 -> b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 [2024-11-08 16:34:16,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:34:16,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:34:16,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:34:16,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:34:16,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:34:16,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2024-11-08 16:34:17,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:34:18,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:34:18,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2024-11-08 16:34:18,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e63a2fe/9ced4e3127e747ac9a2492f3310d6561/FLAG1f0f8b161 [2024-11-08 16:34:18,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e63a2fe/9ced4e3127e747ac9a2492f3310d6561 [2024-11-08 16:34:18,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:34:18,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:34:18,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:34:18,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:34:18,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:34:18,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:34:18" (1/1) ... [2024-11-08 16:34:18,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582f5373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:18, skipping insertion in model container [2024-11-08 16:34:18,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:34:18" (1/1) ... [2024-11-08 16:34:18,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:34:20,156 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_label45+token_ring.09.cil-2.c[380323,380336] [2024-11-08 16:34:20,186 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_label45+token_ring.09.cil-2.c[383339,383352] [2024-11-08 16:34:20,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:34:20,392 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:34:21,231 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_label45+token_ring.09.cil-2.c[380323,380336] [2024-11-08 16:34:21,236 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_label45+token_ring.09.cil-2.c[383339,383352] [2024-11-08 16:34:21,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:34:21,320 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:34:21,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21 WrapperNode [2024-11-08 16:34:21,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:34:21,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:34:21,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:34:21,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:34:21,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:21,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:21,877 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13059 [2024-11-08 16:34:21,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:34:21,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:34:21,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:34:21,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:34:21,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:21,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:21,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,051 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-08 16:34:22,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:34:22,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:34:22,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:34:22,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:34:22,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (1/1) ... [2024-11-08 16:34:22,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:34:22,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:34:22,628 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-08 16:34:22,639 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-08 16:34:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:34:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 16:34:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 16:34:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 16:34:22,734 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 16:34:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 16:34:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 16:34:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-08 16:34:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-08 16:34:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 16:34:22,738 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 16:34:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 16:34:22,738 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 16:34:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 16:34:22,738 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 16:34:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:34:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:34:22,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:34:22,896 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:34:22,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:34:30,766 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2024-11-08 16:34:30,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:34:30,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:34:30,834 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-08 16:34:30,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:34:30 BoogieIcfgContainer [2024-11-08 16:34:30,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:34:30,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:34:30,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:34:30,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:34:30,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:34:18" (1/3) ... [2024-11-08 16:34:30,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eda079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:34:30, skipping insertion in model container [2024-11-08 16:34:30,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:34:21" (2/3) ... [2024-11-08 16:34:30,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eda079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:34:30, skipping insertion in model container [2024-11-08 16:34:30,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:34:30" (3/3) ... [2024-11-08 16:34:30,843 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.09.cil-2.c [2024-11-08 16:34:30,860 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:34:30,860 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:34:30,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:34:30,974 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;@77a45891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:34:30,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:34:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:34:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:31,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:31,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:31,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:31,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash 273379068, now seen corresponding path program 1 times [2024-11-08 16:34:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68165971] [2024-11-08 16:34:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:31,668 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-08 16:34:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:31,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68165971] [2024-11-08 16:34:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68165971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:31,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:34:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179486090] [2024-11-08 16:34:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:31,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:34:31,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:34:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:34:31,711 INFO L87 Difference]: Start difference. First operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:33,200 INFO L93 Difference]: Finished difference Result 5116 states and 9393 transitions. [2024-11-08 16:34:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:34:33,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:33,231 INFO L225 Difference]: With dead ends: 5116 [2024-11-08 16:34:33,232 INFO L226 Difference]: Without dead ends: 2549 [2024-11-08 16:34:33,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:34:33,251 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 835 mSDsluCounter, 12425 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:33,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 16750 Invalid, 860 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:34:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-11-08 16:34:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2440. [2024-11-08 16:34:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2407 states have (on average 1.8292480265891151) internal successors, (4403), 2410 states have internal predecessors, (4403), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:34:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4451 transitions. [2024-11-08 16:34:33,415 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4451 transitions. Word has length 146 [2024-11-08 16:34:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4451 transitions. [2024-11-08 16:34:33,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4451 transitions. [2024-11-08 16:34:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:33,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:33,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:34:33,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574534, now seen corresponding path program 1 times [2024-11-08 16:34:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58348814] [2024-11-08 16:34:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:33,830 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-08 16:34:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58348814] [2024-11-08 16:34:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58348814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:33,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:34:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29633687] [2024-11-08 16:34:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:34:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:34:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:34:33,835 INFO L87 Difference]: Start difference. First operand 2440 states and 4451 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:36,532 INFO L93 Difference]: Finished difference Result 3274 states and 5782 transitions. [2024-11-08 16:34:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:34:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:36,550 INFO L225 Difference]: With dead ends: 3274 [2024-11-08 16:34:36,551 INFO L226 Difference]: Without dead ends: 2972 [2024-11-08 16:34:36,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:34:36,555 INFO L432 NwaCegarLoop]: 4271 mSDtfsCounter, 5199 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 17057 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:36,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 17057 Invalid, 1908 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:34:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-08 16:34:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2753. [2024-11-08 16:34:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2695 states have (on average 1.8018552875695732) internal successors, (4856), 2699 states have internal predecessors, (4856), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-08 16:34:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 4943 transitions. [2024-11-08 16:34:36,690 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 4943 transitions. Word has length 146 [2024-11-08 16:34:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:36,691 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 4943 transitions. [2024-11-08 16:34:36,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 4943 transitions. [2024-11-08 16:34:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:36,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:36,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:36,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:34:36,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:36,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1367927158, now seen corresponding path program 1 times [2024-11-08 16:34:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260389297] [2024-11-08 16:34:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:37,143 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-08 16:34:37,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:37,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260389297] [2024-11-08 16:34:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260389297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:37,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:37,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000144028] [2024-11-08 16:34:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:37,149 INFO L87 Difference]: Start difference. First operand 2753 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:40,621 INFO L93 Difference]: Finished difference Result 4022 states and 6969 transitions. [2024-11-08 16:34:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:34:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:40,635 INFO L225 Difference]: With dead ends: 4022 [2024-11-08 16:34:40,635 INFO L226 Difference]: Without dead ends: 3407 [2024-11-08 16:34:40,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:34:40,639 INFO L432 NwaCegarLoop]: 4443 mSDtfsCounter, 5228 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 21936 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:40,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5244 Valid, 21936 Invalid, 2868 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:34:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-11-08 16:34:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3045. [2024-11-08 16:34:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 2962 states have (on average 1.7781904118838623) internal successors, (5267), 2967 states have internal predecessors, (5267), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-08 16:34:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 5392 transitions. [2024-11-08 16:34:40,730 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 5392 transitions. Word has length 146 [2024-11-08 16:34:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 5392 transitions. [2024-11-08 16:34:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 5392 transitions. [2024-11-08 16:34:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:40,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:40,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:34:40,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:40,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 661330552, now seen corresponding path program 1 times [2024-11-08 16:34:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499799597] [2024-11-08 16:34:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:40,985 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-08 16:34:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499799597] [2024-11-08 16:34:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499799597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:40,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463921763] [2024-11-08 16:34:40,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:40,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:40,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:40,988 INFO L87 Difference]: Start difference. First operand 3045 states and 5392 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:43,616 INFO L93 Difference]: Finished difference Result 5124 states and 8706 transitions. [2024-11-08 16:34:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:34:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:43,635 INFO L225 Difference]: With dead ends: 5124 [2024-11-08 16:34:43,636 INFO L226 Difference]: Without dead ends: 4217 [2024-11-08 16:34:43,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:34:43,641 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5222 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5238 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:43,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 21934 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:34:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2024-11-08 16:34:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3633. [2024-11-08 16:34:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3500 states have (on average 1.7417142857142858) internal successors, (6096), 3507 states have internal predecessors, (6096), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-08 16:34:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6301 transitions. [2024-11-08 16:34:43,909 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6301 transitions. Word has length 146 [2024-11-08 16:34:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:43,909 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 6301 transitions. [2024-11-08 16:34:43,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6301 transitions. [2024-11-08 16:34:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:43,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:43,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:43,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:34:43,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:43,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1523164154, now seen corresponding path program 1 times [2024-11-08 16:34:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507377013] [2024-11-08 16:34:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:44,149 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-08 16:34:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507377013] [2024-11-08 16:34:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507377013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682790968] [2024-11-08 16:34:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:44,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:44,155 INFO L87 Difference]: Start difference. First operand 3633 states and 6301 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:46,961 INFO L93 Difference]: Finished difference Result 7254 states and 12043 transitions. [2024-11-08 16:34:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:34:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:46,989 INFO L225 Difference]: With dead ends: 7254 [2024-11-08 16:34:46,989 INFO L226 Difference]: Without dead ends: 5759 [2024-11-08 16:34:46,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:34:46,998 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5221 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5237 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:46,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5237 Valid, 21934 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:34:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-08 16:34:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 4810. [2024-11-08 16:34:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4577 states have (on average 1.694122787852305) internal successors, (7754), 4588 states have internal predecessors, (7754), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-08 16:34:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 8125 transitions. [2024-11-08 16:34:47,213 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 8125 transitions. Word has length 146 [2024-11-08 16:34:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 8125 transitions. [2024-11-08 16:34:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 8125 transitions. [2024-11-08 16:34:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:47,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:47,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:47,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:34:47,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:47,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -527244744, now seen corresponding path program 1 times [2024-11-08 16:34:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:47,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457340503] [2024-11-08 16:34:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:47,450 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-08 16:34:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457340503] [2024-11-08 16:34:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457340503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668469904] [2024-11-08 16:34:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:47,454 INFO L87 Difference]: Start difference. First operand 4810 states and 8125 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:50,248 INFO L93 Difference]: Finished difference Result 11513 states and 18733 transitions. [2024-11-08 16:34:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:34:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:50,314 INFO L225 Difference]: With dead ends: 11513 [2024-11-08 16:34:50,315 INFO L226 Difference]: Without dead ends: 8841 [2024-11-08 16:34:50,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:34:50,331 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5220 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:50,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 21934 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:34:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-08 16:34:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 7171. [2024-11-08 16:34:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7171 states, 6738 states have (on average 1.6444048679133274) internal successors, (11080), 6757 states have internal predecessors, (11080), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-08 16:34:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11801 transitions. [2024-11-08 16:34:50,660 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11801 transitions. Word has length 146 [2024-11-08 16:34:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:50,661 INFO L471 AbstractCegarLoop]: Abstraction has 7171 states and 11801 transitions. [2024-11-08 16:34:50,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11801 transitions. [2024-11-08 16:34:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:50,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:50,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:34:50,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:50,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -39197638, now seen corresponding path program 1 times [2024-11-08 16:34:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836867724] [2024-11-08 16:34:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:50,904 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-08 16:34:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836867724] [2024-11-08 16:34:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836867724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:50,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:50,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327130461] [2024-11-08 16:34:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:50,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:50,907 INFO L87 Difference]: Start difference. First operand 7171 states and 11801 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:53,918 INFO L93 Difference]: Finished difference Result 20032 states and 32175 transitions. [2024-11-08 16:34:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:34:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:53,982 INFO L225 Difference]: With dead ends: 20032 [2024-11-08 16:34:53,982 INFO L226 Difference]: Without dead ends: 14999 [2024-11-08 16:34:54,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:34:54,010 INFO L432 NwaCegarLoop]: 4242 mSDtfsCounter, 5301 mSDsluCounter, 16917 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5317 SdHoareTripleChecker+Valid, 21159 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:54,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5317 Valid, 21159 Invalid, 2444 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:34:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-08 16:34:54,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11908. [2024-11-08 16:34:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6030699774266366) internal successors, (17754), 11110 states have internal predecessors, (17754), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:34:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19229 transitions. [2024-11-08 16:34:54,726 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19229 transitions. Word has length 146 [2024-11-08 16:34:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:54,727 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19229 transitions. [2024-11-08 16:34:54,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19229 transitions. [2024-11-08 16:34:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:54,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:54,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:34:54,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1131832840, now seen corresponding path program 1 times [2024-11-08 16:34:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580937391] [2024-11-08 16:34:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:54,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:55,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:55,093 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-08 16:34:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580937391] [2024-11-08 16:34:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580937391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:55,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867901529] [2024-11-08 16:34:55,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:55,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:55,095 INFO L87 Difference]: Start difference. First operand 11908 states and 19229 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:56,874 INFO L93 Difference]: Finished difference Result 24936 states and 40142 transitions. [2024-11-08 16:34:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:34:56,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:34:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:56,936 INFO L225 Difference]: With dead ends: 24936 [2024-11-08 16:34:56,936 INFO L226 Difference]: Without dead ends: 15166 [2024-11-08 16:34:56,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:34:56,973 INFO L432 NwaCegarLoop]: 4217 mSDtfsCounter, 4877 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:56,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 20864 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:34:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15166 states. [2024-11-08 16:34:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15166 to 11908. [2024-11-08 16:34:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6000902934537247) internal successors, (17721), 11110 states have internal predecessors, (17721), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:34:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19196 transitions. [2024-11-08 16:34:57,693 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19196 transitions. Word has length 146 [2024-11-08 16:34:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19196 transitions. [2024-11-08 16:34:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:34:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19196 transitions. [2024-11-08 16:34:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:34:57,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:57,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:34:57,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:34:57,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:57,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1880962170, now seen corresponding path program 1 times [2024-11-08 16:34:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:34:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139304825] [2024-11-08 16:34:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:34:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:34:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:34:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:34:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:34:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:34:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:57,919 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-08 16:34:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:34:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139304825] [2024-11-08 16:34:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139304825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:34:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470023237] [2024-11-08 16:34:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:34:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:34:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:34:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:34:57,923 INFO L87 Difference]: Start difference. First operand 11908 states and 19196 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:01,172 INFO L93 Difference]: Finished difference Result 37037 states and 59021 transitions. [2024-11-08 16:35:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:35:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:35:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:01,269 INFO L225 Difference]: With dead ends: 37037 [2024-11-08 16:35:01,269 INFO L226 Difference]: Without dead ends: 27267 [2024-11-08 16:35:01,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:35:01,302 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5211 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5227 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:01,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5227 Valid, 21934 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:35:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2024-11-08 16:35:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 21446. [2024-11-08 16:35:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21446 states, 19813 states have (on average 1.5705344975521123) internal successors, (31117), 19880 states have internal predecessors, (31117), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-08 16:35:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21446 states to 21446 states and 34262 transitions. [2024-11-08 16:35:02,239 INFO L78 Accepts]: Start accepts. Automaton has 21446 states and 34262 transitions. Word has length 146 [2024-11-08 16:35:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 21446 states and 34262 transitions. [2024-11-08 16:35:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 21446 states and 34262 transitions. [2024-11-08 16:35:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:35:02,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:02,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:02,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:35:02,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:35:02,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:02,254 INFO L85 PathProgramCache]: Analyzing trace with hash 38486456, now seen corresponding path program 1 times [2024-11-08 16:35:02,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:02,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119750463] [2024-11-08 16:35:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:35:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:35:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:35:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:35:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:35:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:02,459 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-08 16:35:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119750463] [2024-11-08 16:35:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119750463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237107282] [2024-11-08 16:35:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:02,462 INFO L87 Difference]: Start difference. First operand 21446 states and 34262 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:07,016 INFO L93 Difference]: Finished difference Result 71117 states and 113589 transitions. [2024-11-08 16:35:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:35:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:35:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:07,232 INFO L225 Difference]: With dead ends: 71117 [2024-11-08 16:35:07,233 INFO L226 Difference]: Without dead ends: 51809 [2024-11-08 16:35:07,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:35:07,299 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5216 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:07,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 21934 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:35:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2024-11-08 16:35:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 40583. [2024-11-08 16:35:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40583 states, 37350 states have (on average 1.55285140562249) internal successors, (57999), 37481 states have internal predecessors, (57999), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-08 16:35:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40583 states to 40583 states and 64970 transitions. [2024-11-08 16:35:09,723 INFO L78 Accepts]: Start accepts. Automaton has 40583 states and 64970 transitions. Word has length 146 [2024-11-08 16:35:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 40583 states and 64970 transitions. [2024-11-08 16:35:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40583 states and 64970 transitions. [2024-11-08 16:35:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:35:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:09,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:35:09,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:35:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1683516230, now seen corresponding path program 1 times [2024-11-08 16:35:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936790853] [2024-11-08 16:35:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:35:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:35:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:35:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:35:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:35:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:09,959 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-08 16:35:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936790853] [2024-11-08 16:35:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936790853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790186187] [2024-11-08 16:35:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:09,962 INFO L87 Difference]: Start difference. First operand 40583 states and 64970 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:17,235 INFO L93 Difference]: Finished difference Result 154890 states and 248505 transitions. [2024-11-08 16:35:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:35:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:35:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:17,977 INFO L225 Difference]: With dead ends: 154890 [2024-11-08 16:35:17,977 INFO L226 Difference]: Without dead ends: 116445 [2024-11-08 16:35:18,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:35:18,086 INFO L432 NwaCegarLoop]: 4438 mSDtfsCounter, 5293 mSDsluCounter, 17482 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 21920 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:18,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 21920 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:35:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116445 states. [2024-11-08 16:35:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116445 to 77449. [2024-11-08 16:35:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77449 states, 71144 states have (on average 1.541254357359721) internal successors, (109651), 71403 states have internal predecessors, (109651), 4505 states have call successors, (4505), 1543 states have call predecessors, (4505), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-08 16:35:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77449 states to 77449 states and 125476 transitions. [2024-11-08 16:35:22,916 INFO L78 Accepts]: Start accepts. Automaton has 77449 states and 125476 transitions. Word has length 146 [2024-11-08 16:35:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:22,916 INFO L471 AbstractCegarLoop]: Abstraction has 77449 states and 125476 transitions. [2024-11-08 16:35:22,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:35:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 77449 states and 125476 transitions. [2024-11-08 16:35:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:35:23,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:23,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:35:23,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:35:23,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 245415996, now seen corresponding path program 1 times [2024-11-08 16:35:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:23,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693110873] [2024-11-08 16:35:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:35:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:35:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:35:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:35:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:35:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,477 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-08 16:35:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693110873] [2024-11-08 16:35:23,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693110873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069382896] [2024-11-08 16:35:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:23,479 INFO L87 Difference]: Start difference. First operand 77449 states and 125476 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)