./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e80d4f8b0edf8f5c4127bb92c8390ef5eb0df30ae80a58b9f994310767a3efd9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:20:59,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:20:59,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:20:59,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:20:59,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:20:59,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:20:59,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:20:59,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:20:59,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:20:59,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:20:59,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:20:59,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:20:59,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:20:59,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:20:59,549 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:20:59,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:20:59,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:20:59,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:20:59,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:20:59,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:20:59,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:20:59,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:20:59,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:20:59,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:20:59,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:20:59,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:20:59,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:20:59,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:20:59,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:20:59,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:20:59,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:20:59,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:20:59,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:20:59,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:20:59,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:20:59,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:20:59,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:20:59,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:20:59,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:20:59,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:20:59,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:20:59,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:20:59,563 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-clean/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-clean/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 -> e80d4f8b0edf8f5c4127bb92c8390ef5eb0df30ae80a58b9f994310767a3efd9 [2024-10-11 04:20:59,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:20:59,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:20:59,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:20:59,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:20:59,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:20:59,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c [2024-10-11 04:21:01,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:21:01,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:21:01,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c [2024-10-11 04:21:01,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46834fe3e/9eb53740e7314327bf0bcd3d5151e89a/FLAG94f7a9f52 [2024-10-11 04:21:01,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46834fe3e/9eb53740e7314327bf0bcd3d5151e89a [2024-10-11 04:21:01,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:21:01,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:21:01,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:01,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:21:01,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:21:01,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:01" (1/1) ... [2024-10-11 04:21:01,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e621da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:01, skipping insertion in model container [2024-10-11 04:21:01,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:01" (1/1) ... [2024-10-11 04:21:02,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:21:03,781 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c[380323,380336] [2024-10-11 04:21:03,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:21:04,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:04,167 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:21:04,933 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c[380323,380336] [2024-10-11 04:21:04,939 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:21:04,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:05,032 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:21:05,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05 WrapperNode [2024-10-11 04:21:05,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:05,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:05,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:21:05,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:21:05,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,565 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13239 [2024-10-11 04:21:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:05,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:21:05,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:21:05,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:21:05,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:21:05,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:05,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:06,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:06,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:06,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:06,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:21:06,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:21:06,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:21:06,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:21:06,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (1/1) ... [2024-10-11 04:21:06,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:21:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:06,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:21:06,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:21:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:21:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:21:06,360 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:21:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:21:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:21:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:21:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:21:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:21:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:21:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:21:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:21:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:21:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:21:06,517 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:21:06,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:21:14,556 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-11 04:21:14,557 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:21:14,689 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:21:14,690 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 04:21:14,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:14 BoogieIcfgContainer [2024-10-11 04:21:14,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:21:14,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:21:14,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:21:14,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:21:14,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:21:01" (1/3) ... [2024-10-11 04:21:14,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6e455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:14, skipping insertion in model container [2024-10-11 04:21:14,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:05" (2/3) ... [2024-10-11 04:21:14,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6e455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:14, skipping insertion in model container [2024-10-11 04:21:14,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:14" (3/3) ... [2024-10-11 04:21:14,702 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.12.cil-1.c [2024-10-11 04:21:14,717 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:21:14,717 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:21:14,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:21:14,842 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;@10de72ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:21:14,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:21:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 2479 states, 2441 states have (on average 1.8758705448586646) internal successors, (4579), 2446 states have internal predecessors, (4579), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 04:21:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:14,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:14,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:14,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:14,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -30135490, now seen corresponding path program 1 times [2024-10-11 04:21:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670925063] [2024-10-11 04:21:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:15,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:15,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670925063] [2024-10-11 04:21:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670925063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:21:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500565356] [2024-10-11 04:21:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:15,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:21:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:21:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:21:15,684 INFO L87 Difference]: Start difference. First operand has 2479 states, 2441 states have (on average 1.8758705448586646) internal successors, (4579), 2446 states have internal predecessors, (4579), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-10-11 04:21:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:17,718 INFO L93 Difference]: Finished difference Result 5083 states and 9494 transitions. [2024-10-11 04:21:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:21:17,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:17,753 INFO L225 Difference]: With dead ends: 5083 [2024-10-11 04:21:17,753 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:21:17,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:21:17,772 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 993 mSDsluCounter, 12222 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 16490 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:17,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 16490 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:21:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:21:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:21:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2438 states have (on average 1.8371616078753077) internal successors, (4479), 2441 states have internal predecessors, (4479), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:21:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4533 transitions. [2024-10-11 04:21:17,942 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4533 transitions. Word has length 162 [2024-10-11 04:21:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4533 transitions. [2024-10-11 04:21:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-10-11 04:21:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4533 transitions. [2024-10-11 04:21:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:17,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:17,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:17,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:21:17,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:17,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1739336124, now seen corresponding path program 1 times [2024-10-11 04:21:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663657445] [2024-10-11 04:21:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:18,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:18,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663657445] [2024-10-11 04:21:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663657445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:21:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962654343] [2024-10-11 04:21:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:21:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:21:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:21:18,287 INFO L87 Difference]: Start difference. First operand 2474 states and 4533 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-10-11 04:21:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:20,317 INFO L93 Difference]: Finished difference Result 2944 states and 5318 transitions. [2024-10-11 04:21:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:21:20,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:20,329 INFO L225 Difference]: With dead ends: 2944 [2024-10-11 04:21:20,329 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:21:20,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:21:20,332 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 981 mSDsluCounter, 12213 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 16477 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:20,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 16477 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:21:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:21:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:21:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2438 states have (on average 1.8367514356029533) internal successors, (4478), 2441 states have internal predecessors, (4478), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:21:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4532 transitions. [2024-10-11 04:21:20,403 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4532 transitions. Word has length 162 [2024-10-11 04:21:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:20,404 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4532 transitions. [2024-10-11 04:21:20,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-10-11 04:21:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4532 transitions. [2024-10-11 04:21:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:20,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:20,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:21:20,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:20,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash -191789510, now seen corresponding path program 1 times [2024-10-11 04:21:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144975067] [2024-10-11 04:21:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144975067] [2024-10-11 04:21:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144975067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:20,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:21:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501392239] [2024-10-11 04:21:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:21:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:21:20,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:21:20,774 INFO L87 Difference]: Start difference. First operand 2474 states and 4532 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:24,202 INFO L93 Difference]: Finished difference Result 3423 states and 6122 transitions. [2024-10-11 04:21:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:21:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:24,215 INFO L225 Difference]: With dead ends: 3423 [2024-10-11 04:21:24,215 INFO L226 Difference]: Without dead ends: 3088 [2024-10-11 04:21:24,217 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-10-11 04:21:24,218 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 5449 mSDsluCounter, 12796 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 17079 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:24,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 17079 Invalid, 2468 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:21:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2024-10-11 04:21:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2827. [2024-10-11 04:21:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2763 states have (on average 1.8154180238870792) internal successors, (5016), 2767 states have internal predecessors, (5016), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 04:21:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 5115 transitions. [2024-10-11 04:21:24,349 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 5115 transitions. Word has length 162 [2024-10-11 04:21:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:24,351 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 5115 transitions. [2024-10-11 04:21:24,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 5115 transitions. [2024-10-11 04:21:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:24,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:24,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:21:24,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1897809402, now seen corresponding path program 1 times [2024-10-11 04:21:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971883322] [2024-10-11 04:21:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971883322] [2024-10-11 04:21:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971883322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230608777] [2024-10-11 04:21:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:24,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:24,711 INFO L87 Difference]: Start difference. First operand 2827 states and 5115 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:29,013 INFO L93 Difference]: Finished difference Result 4278 states and 7548 transitions. [2024-10-11 04:21:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:29,034 INFO L225 Difference]: With dead ends: 4278 [2024-10-11 04:21:29,035 INFO L226 Difference]: Without dead ends: 3590 [2024-10-11 04:21:29,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:29,039 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5484 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5503 SdHoareTripleChecker+Valid, 21882 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:29,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5503 Valid, 21882 Invalid, 3805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 04:21:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2024-10-11 04:21:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3153. [2024-10-11 04:21:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3061 states have (on average 1.796798431885005) internal successors, (5500), 3066 states have internal predecessors, (5500), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 04:21:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 5643 transitions. [2024-10-11 04:21:29,206 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 5643 transitions. Word has length 162 [2024-10-11 04:21:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:29,207 INFO L471 AbstractCegarLoop]: Abstraction has 3153 states and 5643 transitions. [2024-10-11 04:21:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 5643 transitions. [2024-10-11 04:21:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:29,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:29,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:29,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:21:29,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1986547528, now seen corresponding path program 1 times [2024-10-11 04:21:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:29,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864279678] [2024-10-11 04:21:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864279678] [2024-10-11 04:21:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864279678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157246518] [2024-10-11 04:21:29,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:29,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:29,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:29,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:29,592 INFO L87 Difference]: Start difference. First operand 3153 states and 5643 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:33,211 INFO L93 Difference]: Finished difference Result 5531 states and 9624 transitions. [2024-10-11 04:21:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:33,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:33,232 INFO L225 Difference]: With dead ends: 5531 [2024-10-11 04:21:33,232 INFO L226 Difference]: Without dead ends: 4517 [2024-10-11 04:21:33,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:33,239 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 5596 mSDsluCounter, 16898 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5615 SdHoareTripleChecker+Valid, 21139 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:33,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5615 Valid, 21139 Invalid, 3206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:21:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2024-10-11 04:21:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3806. [2024-10-11 04:21:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7684527063969382) internal successors, (6469), 3665 states have internal predecessors, (6469), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:21:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6704 transitions. [2024-10-11 04:21:33,393 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6704 transitions. Word has length 162 [2024-10-11 04:21:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:33,393 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6704 transitions. [2024-10-11 04:21:33,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6704 transitions. [2024-10-11 04:21:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:33,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:33,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:21:33,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 520549946, now seen corresponding path program 1 times [2024-10-11 04:21:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844595715] [2024-10-11 04:21:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:33,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844595715] [2024-10-11 04:21:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844595715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650275768] [2024-10-11 04:21:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:33,721 INFO L87 Difference]: Start difference. First operand 3806 states and 6704 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:35,774 INFO L93 Difference]: Finished difference Result 6172 states and 10676 transitions. [2024-10-11 04:21:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:21:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:35,794 INFO L225 Difference]: With dead ends: 6172 [2024-10-11 04:21:35,794 INFO L226 Difference]: Without dead ends: 4505 [2024-10-11 04:21:35,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:21:35,801 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5053 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5073 SdHoareTripleChecker+Valid, 20856 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:35,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5073 Valid, 20856 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:21:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2024-10-11 04:21:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3806. [2024-10-11 04:21:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7670858392564244) internal successors, (6464), 3665 states have internal predecessors, (6464), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:21:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6699 transitions. [2024-10-11 04:21:35,953 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6699 transitions. Word has length 162 [2024-10-11 04:21:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:35,954 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6699 transitions. [2024-10-11 04:21:35,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6699 transitions. [2024-10-11 04:21:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:35,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:35,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:21:35,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1615333256, now seen corresponding path program 1 times [2024-10-11 04:21:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:35,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980460583] [2024-10-11 04:21:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980460583] [2024-10-11 04:21:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980460583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190682385] [2024-10-11 04:21:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:36,253 INFO L87 Difference]: Start difference. First operand 3806 states and 6699 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:38,293 INFO L93 Difference]: Finished difference Result 6161 states and 10640 transitions. [2024-10-11 04:21:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:21:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:38,328 INFO L225 Difference]: With dead ends: 6161 [2024-10-11 04:21:38,329 INFO L226 Difference]: Without dead ends: 4494 [2024-10-11 04:21:38,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:21:38,337 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5203 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 16728 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:38,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 16728 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:21:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-10-11 04:21:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3806. [2024-10-11 04:21:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7657189721159103) internal successors, (6459), 3665 states have internal predecessors, (6459), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:21:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6694 transitions. [2024-10-11 04:21:38,509 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6694 transitions. Word has length 162 [2024-10-11 04:21:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6694 transitions. [2024-10-11 04:21:38,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6694 transitions. [2024-10-11 04:21:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:38,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:38,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:38,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:21:38,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:38,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1197444554, now seen corresponding path program 1 times [2024-10-11 04:21:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068841589] [2024-10-11 04:21:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068841589] [2024-10-11 04:21:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068841589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:38,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670488134] [2024-10-11 04:21:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:38,830 INFO L87 Difference]: Start difference. First operand 3806 states and 6694 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:42,830 INFO L93 Difference]: Finished difference Result 7915 states and 13503 transitions. [2024-10-11 04:21:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:42,853 INFO L225 Difference]: With dead ends: 7915 [2024-10-11 04:21:42,854 INFO L226 Difference]: Without dead ends: 6248 [2024-10-11 04:21:42,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:42,862 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5467 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5486 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:42,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5486 Valid, 21880 Invalid, 3728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:21:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2024-10-11 04:21:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 5127. [2024-10-11 04:21:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4867 states have (on average 1.7279638380932814) internal successors, (8410), 4878 states have internal predecessors, (8410), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:21:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8835 transitions. [2024-10-11 04:21:43,181 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8835 transitions. Word has length 162 [2024-10-11 04:21:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:43,181 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8835 transitions. [2024-10-11 04:21:43,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8835 transitions. [2024-10-11 04:21:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:43,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:43,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:43,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:21:43,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:43,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 201509048, now seen corresponding path program 1 times [2024-10-11 04:21:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102758506] [2024-10-11 04:21:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102758506] [2024-10-11 04:21:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102758506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:43,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110908303] [2024-10-11 04:21:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:43,474 INFO L87 Difference]: Start difference. First operand 5127 states and 8835 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:45,291 INFO L93 Difference]: Finished difference Result 9259 states and 15717 transitions. [2024-10-11 04:21:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:21:45,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:45,306 INFO L225 Difference]: With dead ends: 9259 [2024-10-11 04:21:45,306 INFO L226 Difference]: Without dead ends: 6271 [2024-10-11 04:21:45,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:21:45,316 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5202 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 16728 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:45,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 16728 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:21:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2024-10-11 04:21:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 5127. [2024-10-11 04:21:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4867 states have (on average 1.7261146496815287) internal successors, (8401), 4878 states have internal predecessors, (8401), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:21:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8826 transitions. [2024-10-11 04:21:45,534 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8826 transitions. Word has length 162 [2024-10-11 04:21:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:45,534 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8826 transitions. [2024-10-11 04:21:45,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8826 transitions. [2024-10-11 04:21:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:45,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:45,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:21:45,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1415931402, now seen corresponding path program 1 times [2024-10-11 04:21:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541614207] [2024-10-11 04:21:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541614207] [2024-10-11 04:21:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541614207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:45,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:45,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356334063] [2024-10-11 04:21:45,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:45,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:45,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:45,817 INFO L87 Difference]: Start difference. First operand 5127 states and 8826 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:49,654 INFO L93 Difference]: Finished difference Result 12710 states and 21332 transitions. [2024-10-11 04:21:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:49,682 INFO L225 Difference]: With dead ends: 12710 [2024-10-11 04:21:49,683 INFO L226 Difference]: Without dead ends: 9722 [2024-10-11 04:21:49,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:49,695 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5459 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:49,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 21880 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:21:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2024-10-11 04:21:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7779. [2024-10-11 04:21:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7779 states, 7295 states have (on average 1.6864976010966415) internal successors, (12303), 7314 states have internal predecessors, (12303), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 04:21:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 13126 transitions. [2024-10-11 04:21:50,106 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 13126 transitions. Word has length 162 [2024-10-11 04:21:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:50,106 INFO L471 AbstractCegarLoop]: Abstraction has 7779 states and 13126 transitions. [2024-10-11 04:21:50,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 13126 transitions. [2024-10-11 04:21:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:50,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:50,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:50,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:21:50,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:50,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1052464904, now seen corresponding path program 1 times [2024-10-11 04:21:50,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145878370] [2024-10-11 04:21:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145878370] [2024-10-11 04:21:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145878370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:50,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596405866] [2024-10-11 04:21:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:50,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:50,387 INFO L87 Difference]: Start difference. First operand 7779 states and 13126 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:54,459 INFO L93 Difference]: Finished difference Result 22316 states and 37122 transitions. [2024-10-11 04:21:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:54,515 INFO L225 Difference]: With dead ends: 22316 [2024-10-11 04:21:54,515 INFO L226 Difference]: Without dead ends: 16676 [2024-10-11 04:21:54,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:54,541 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5458 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5477 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:54,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5477 Valid, 21880 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:21:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2024-10-11 04:21:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 13096. [2024-10-11 04:21:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13096 states, 12164 states have (on average 1.6544722130878) internal successors, (20125), 12199 states have internal predecessors, (20125), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 04:21:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 21798 transitions. [2024-10-11 04:21:55,152 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 21798 transitions. Word has length 162 [2024-10-11 04:21:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:55,153 INFO L471 AbstractCegarLoop]: Abstraction has 13096 states and 21798 transitions. [2024-10-11 04:21:55,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 21798 transitions. [2024-10-11 04:21:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:21:55,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:55,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:55,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:21:55,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -763645514, now seen corresponding path program 1 times [2024-10-11 04:21:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776466987] [2024-10-11 04:21:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:21:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:21:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:21:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776466987] [2024-10-11 04:21:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776466987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976085526] [2024-10-11 04:21:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:55,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:55,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:55,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:55,433 INFO L87 Difference]: Start difference. First operand 13096 states and 21798 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:59,830 INFO L93 Difference]: Finished difference Result 41527 states and 68892 transitions. [2024-10-11 04:21:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:59,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:21:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:59,935 INFO L225 Difference]: With dead ends: 41527 [2024-10-11 04:21:59,935 INFO L226 Difference]: Without dead ends: 30570 [2024-10-11 04:21:59,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:59,979 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 5557 mSDsluCounter, 16898 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21139 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:59,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21139 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:22:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30570 states. [2024-10-11 04:22:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30570 to 23761. [2024-10-11 04:22:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23761 states, 21933 states have (on average 1.6329275520904574) internal successors, (35815), 22000 states have internal predecessors, (35815), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:22:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39350 transitions. [2024-10-11 04:22:01,355 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39350 transitions. Word has length 162 [2024-10-11 04:22:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39350 transitions. [2024-10-11 04:22:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39350 transitions. [2024-10-11 04:22:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:22:01,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:01,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:01,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:22:01,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:01,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1308518088, now seen corresponding path program 1 times [2024-10-11 04:22:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:01,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575173790] [2024-10-11 04:22:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:22:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:22:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:22:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:22:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:01,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575173790] [2024-10-11 04:22:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575173790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:01,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:01,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877540075] [2024-10-11 04:22:01,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:01,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:01,632 INFO L87 Difference]: Start difference. First operand 23761 states and 39350 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:04,671 INFO L93 Difference]: Finished difference Result 52623 states and 87952 transitions. [2024-10-11 04:22:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:04,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:22:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:04,796 INFO L225 Difference]: With dead ends: 52623 [2024-10-11 04:22:04,797 INFO L226 Difference]: Without dead ends: 31001 [2024-10-11 04:22:04,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:04,859 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5055 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5075 SdHoareTripleChecker+Valid, 20856 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5075 Valid, 20856 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:22:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31001 states. [2024-10-11 04:22:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31001 to 23761. [2024-10-11 04:22:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23761 states, 21933 states have (on average 1.62996398121552) internal successors, (35750), 22000 states have internal predecessors, (35750), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:22:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39285 transitions. [2024-10-11 04:22:06,600 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39285 transitions. Word has length 162 [2024-10-11 04:22:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39285 transitions. [2024-10-11 04:22:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39285 transitions. [2024-10-11 04:22:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:22:06,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:06,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:06,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:22:06,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:06,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -633357962, now seen corresponding path program 1 times [2024-10-11 04:22:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7221805] [2024-10-11 04:22:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:22:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:22:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:22:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:22:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7221805] [2024-10-11 04:22:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7221805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714591553] [2024-10-11 04:22:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:06,887 INFO L87 Difference]: Start difference. First operand 23761 states and 39285 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)