./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.11.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.11.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 88d274727136b53784890e6d1e1bf78dc0f4647c470f9c2edec85a87ad689472 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:20:21,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:20:21,747 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:21,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:20:21,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:20:21,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:20:21,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:20:21,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:20:21,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:20:21,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:20:21,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:20:21,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:20:21,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:20:21,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:20:21,777 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:20:21,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:20:21,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:20:21,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:20:21,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:20:21,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:20:21,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:20:21,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:20:21,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:20:21,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:20:21,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:20:21,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:20:21,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:20:21,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:20:21,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:20:21,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:20:21,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:20:21,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:20:21,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:20:21,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:20:21,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:20:21,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:20:21,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:20:21,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:20:21,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:20:21,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:20:21,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:20:21,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:20:21,793 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 -> 88d274727136b53784890e6d1e1bf78dc0f4647c470f9c2edec85a87ad689472 [2024-10-11 04:20:22,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:20:22,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:20:22,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:20:22,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:20:22,050 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:20:22,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.11.cil-1.c [2024-10-11 04:20:23,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:20:24,142 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:20:24,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.11.cil-1.c [2024-10-11 04:20:24,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a43c7b99/1ceb2bef69274c6a80f27602b60496eb/FLAGa32365a5d [2024-10-11 04:20:24,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a43c7b99/1ceb2bef69274c6a80f27602b60496eb [2024-10-11 04:20:24,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:20:24,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:20:24,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:20:24,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:20:24,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:20:24,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:20:24" (1/1) ... [2024-10-11 04:20:24,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463b1d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:24, skipping insertion in model container [2024-10-11 04:20:24,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:20:24" (1/1) ... [2024-10-11 04:20:24,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:20:26,262 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.11.cil-1.c[380323,380336] [2024-10-11 04:20:26,289 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.11.cil-1.c[383339,383352] [2024-10-11 04:20:26,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:20:26,543 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:20:27,268 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.11.cil-1.c[380323,380336] [2024-10-11 04:20:27,275 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.11.cil-1.c[383339,383352] [2024-10-11 04:20:27,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:20:27,406 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:20:27,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27 WrapperNode [2024-10-11 04:20:27,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:20:27,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:20:27,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:20:27,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:20:27,417 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:20:27" (1/1) ... [2024-10-11 04:20:27,523 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:20:27" (1/1) ... [2024-10-11 04:20:27,961 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13179 [2024-10-11 04:20:27,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:20:27,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:20:27,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:20:27,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:20:27,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:27,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,194 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:20:28,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:20:28,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:20:28,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:20:28,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:20:28,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (1/1) ... [2024-10-11 04:20:28,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:20:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:20:28,571 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:20:28,573 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:20:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:20:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:20:28,624 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:20:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:20:28,624 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:20:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:20:28,624 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:20:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:20:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:20:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:20:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:20:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:20:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:20:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:20:28,626 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:20:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:20:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:20:28,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:20:28,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:20:28,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:20:36,791 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2024-10-11 04:20:36,791 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:20:36,931 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:20:36,932 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:20:36,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:20:36 BoogieIcfgContainer [2024-10-11 04:20:36,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:20:36,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:20:36,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:20:36,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:20:36,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:20:24" (1/3) ... [2024-10-11 04:20:36,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279489c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:20:36, skipping insertion in model container [2024-10-11 04:20:36,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:20:27" (2/3) ... [2024-10-11 04:20:36,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279489c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:20:36, skipping insertion in model container [2024-10-11 04:20:36,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:20:36" (3/3) ... [2024-10-11 04:20:36,944 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.11.cil-1.c [2024-10-11 04:20:36,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:20:36,965 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:20:37,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:20:37,175 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;@1ebdcc68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:20:37,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:20:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2419 states have (on average 1.8768085985944605) internal successors, (4540), 2424 states have internal predecessors, (4540), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:20:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:37,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:37,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash 190505612, now seen corresponding path program 1 times [2024-10-11 04:20:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973603075] [2024-10-11 04:20:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:37,948 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:20:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973603075] [2024-10-11 04:20:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973603075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:20:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254366531] [2024-10-11 04:20:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:20:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:20:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:20:37,998 INFO L87 Difference]: Start difference. First operand has 2456 states, 2419 states have (on average 1.8768085985944605) internal successors, (4540), 2424 states have internal predecessors, (4540), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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:20:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:40,106 INFO L93 Difference]: Finished difference Result 5021 states and 9382 transitions. [2024-10-11 04:20:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:20:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:40,144 INFO L225 Difference]: With dead ends: 5021 [2024-10-11 04:20:40,145 INFO L226 Difference]: Without dead ends: 2571 [2024-10-11 04:20:40,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:20:40,157 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 916 mSDsluCounter, 12200 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 16449 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:40,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 16449 Invalid, 1051 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:20:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-10-11 04:20:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2451. [2024-10-11 04:20:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2416 states have (on average 1.8385761589403973) internal successors, (4442), 2419 states have internal predecessors, (4442), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:20:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4494 transitions. [2024-10-11 04:20:40,335 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4494 transitions. Word has length 152 [2024-10-11 04:20:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 4494 transitions. [2024-10-11 04:20:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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:20:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4494 transitions. [2024-10-11 04:20:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:40,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:40,342 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] [2024-10-11 04:20:40,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:20:40,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1978375434, now seen corresponding path program 1 times [2024-10-11 04:20:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955622004] [2024-10-11 04:20:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:40,819 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:20:40,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955622004] [2024-10-11 04:20:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955622004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:20:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586391430] [2024-10-11 04:20:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:40,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:20:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:20:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:20:40,826 INFO L87 Difference]: Start difference. First operand 2451 states and 4494 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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:20:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:43,878 INFO L93 Difference]: Finished difference Result 3334 states and 5970 transitions. [2024-10-11 04:20:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:20:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:43,898 INFO L225 Difference]: With dead ends: 3334 [2024-10-11 04:20:43,899 INFO L226 Difference]: Without dead ends: 3021 [2024-10-11 04:20:43,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:43,904 INFO L432 NwaCegarLoop]: 4216 mSDtfsCounter, 5341 mSDsluCounter, 12642 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5359 SdHoareTripleChecker+Valid, 16858 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:43,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5359 Valid, 16858 Invalid, 2246 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:20:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2024-10-11 04:20:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2780. [2024-10-11 04:20:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2718 states have (on average 1.8178807947019868) internal successors, (4941), 2722 states have internal predecessors, (4941), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 04:20:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5036 transitions. [2024-10-11 04:20:44,036 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5036 transitions. Word has length 152 [2024-10-11 04:20:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:44,037 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5036 transitions. [2024-10-11 04:20:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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:20:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5036 transitions. [2024-10-11 04:20:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:44,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:44,045 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] [2024-10-11 04:20:44,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:20:44,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1779625978, now seen corresponding path program 1 times [2024-10-11 04:20:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426242766] [2024-10-11 04:20:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:44,429 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:20:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426242766] [2024-10-11 04:20:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426242766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:44,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732472406] [2024-10-11 04:20:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:44,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:44,433 INFO L87 Difference]: Start difference. First operand 2780 states and 5036 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:48,219 INFO L93 Difference]: Finished difference Result 4129 states and 7292 transitions. [2024-10-11 04:20:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:48,239 INFO L225 Difference]: With dead ends: 4129 [2024-10-11 04:20:48,240 INFO L226 Difference]: Without dead ends: 3487 [2024-10-11 04:20:48,244 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:20:48,246 INFO L432 NwaCegarLoop]: 4412 mSDtfsCounter, 5370 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5388 SdHoareTripleChecker+Valid, 21751 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:48,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5388 Valid, 21751 Invalid, 3539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:20:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2024-10-11 04:20:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3084. [2024-10-11 04:20:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2995 states have (on average 1.7996661101836393) internal successors, (5390), 3000 states have internal predecessors, (5390), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 04:20:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 5527 transitions. [2024-10-11 04:20:48,377 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 5527 transitions. Word has length 152 [2024-10-11 04:20:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:48,378 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 5527 transitions. [2024-10-11 04:20:48,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 5527 transitions. [2024-10-11 04:20:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:48,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:48,382 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] [2024-10-11 04:20:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:20:48,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1970468744, now seen corresponding path program 1 times [2024-10-11 04:20:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:48,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481456403] [2024-10-11 04:20:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:48,798 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:20:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481456403] [2024-10-11 04:20:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481456403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:48,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341314099] [2024-10-11 04:20:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:48,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:48,803 INFO L87 Difference]: Start difference. First operand 3084 states and 5527 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:52,397 INFO L93 Difference]: Finished difference Result 5294 states and 9217 transitions. [2024-10-11 04:20:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:52,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:52,419 INFO L225 Difference]: With dead ends: 5294 [2024-10-11 04:20:52,420 INFO L226 Difference]: Without dead ends: 4348 [2024-10-11 04:20:52,425 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:20:52,426 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5368 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5386 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:52,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5386 Valid, 21749 Invalid, 3537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:20:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2024-10-11 04:20:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3693. [2024-10-11 04:20:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.771549295774648) internal successors, (6289), 3557 states have internal predecessors, (6289), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:20:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6514 transitions. [2024-10-11 04:20:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6514 transitions. Word has length 152 [2024-10-11 04:20:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6514 transitions. [2024-10-11 04:20:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6514 transitions. [2024-10-11 04:20:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:52,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:52,681 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] [2024-10-11 04:20:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:20:52,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1649338426, now seen corresponding path program 1 times [2024-10-11 04:20:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750945457] [2024-10-11 04:20:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:52,982 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:20:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:52,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750945457] [2024-10-11 04:20:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750945457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:52,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347638821] [2024-10-11 04:20:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:52,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:52,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:52,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:52,988 INFO L87 Difference]: Start difference. First operand 3693 states and 6514 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:54,779 INFO L93 Difference]: Finished difference Result 5891 states and 10195 transitions. [2024-10-11 04:20:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:54,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:54,798 INFO L225 Difference]: With dead ends: 5891 [2024-10-11 04:20:54,798 INFO L226 Difference]: Without dead ends: 4336 [2024-10-11 04:20:54,805 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:20:54,806 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5113 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5132 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:54,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5132 Valid, 16671 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:20:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2024-10-11 04:20:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 3693. [2024-10-11 04:20:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7701408450704226) internal successors, (6284), 3557 states have internal predecessors, (6284), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:20:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6509 transitions. [2024-10-11 04:20:54,963 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6509 transitions. Word has length 152 [2024-10-11 04:20:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:54,964 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6509 transitions. [2024-10-11 04:20:54,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6509 transitions. [2024-10-11 04:20:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:54,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:54,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:20:54,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1697576904, now seen corresponding path program 1 times [2024-10-11 04:20:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447145039] [2024-10-11 04:20:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:55,260 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:20:55,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:55,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447145039] [2024-10-11 04:20:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447145039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313876182] [2024-10-11 04:20:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:55,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:55,267 INFO L87 Difference]: Start difference. First operand 3693 states and 6509 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:56,942 INFO L93 Difference]: Finished difference Result 5885 states and 10169 transitions. [2024-10-11 04:20:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:56,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:56,970 INFO L225 Difference]: With dead ends: 5885 [2024-10-11 04:20:56,970 INFO L226 Difference]: Without dead ends: 4330 [2024-10-11 04:20:56,978 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:20:56,981 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5111 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:56,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 16671 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:20:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2024-10-11 04:20:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3693. [2024-10-11 04:20:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7687323943661972) internal successors, (6279), 3557 states have internal predecessors, (6279), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:20:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6504 transitions. [2024-10-11 04:20:57,147 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6504 transitions. Word has length 152 [2024-10-11 04:20:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:57,147 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6504 transitions. [2024-10-11 04:20:57,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6504 transitions. [2024-10-11 04:20:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:57,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:57,151 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] [2024-10-11 04:20:57,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:20:57,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:57,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1112805254, now seen corresponding path program 1 times [2024-10-11 04:20:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:57,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224848607] [2024-10-11 04:20:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:57,405 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:20:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224848607] [2024-10-11 04:20:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224848607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:57,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464168436] [2024-10-11 04:20:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:57,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:57,408 INFO L87 Difference]: Start difference. First operand 3693 states and 6504 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:59,274 INFO L93 Difference]: Finished difference Result 5878 states and 10141 transitions. [2024-10-11 04:20:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:59,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:20:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:59,295 INFO L225 Difference]: With dead ends: 5878 [2024-10-11 04:20:59,296 INFO L226 Difference]: Without dead ends: 4323 [2024-10-11 04:20:59,303 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:20:59,304 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 4972 mSDsluCounter, 16586 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4991 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:59,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4991 Valid, 20789 Invalid, 1803 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:20:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2024-10-11 04:20:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 3693. [2024-10-11 04:20:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7673239436619719) internal successors, (6274), 3557 states have internal predecessors, (6274), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:20:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6499 transitions. [2024-10-11 04:20:59,515 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6499 transitions. Word has length 152 [2024-10-11 04:20:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:59,515 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6499 transitions. [2024-10-11 04:20:59,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:20:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6499 transitions. [2024-10-11 04:20:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:20:59,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:59,519 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] [2024-10-11 04:20:59,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:20:59,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:59,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 678299656, now seen corresponding path program 1 times [2024-10-11 04:20:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:59,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371964337] [2024-10-11 04:20:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:59,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:20:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:20:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:20:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:20:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:59,818 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:20:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:59,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371964337] [2024-10-11 04:20:59,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371964337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:59,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:59,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875949452] [2024-10-11 04:20:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:59,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:59,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:59,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:59,821 INFO L87 Difference]: Start difference. First operand 3693 states and 6499 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:01,470 INFO L93 Difference]: Finished difference Result 5866 states and 10103 transitions. [2024-10-11 04:21:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:21:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:01,488 INFO L225 Difference]: With dead ends: 5866 [2024-10-11 04:21:01,488 INFO L226 Difference]: Without dead ends: 4311 [2024-10-11 04:21:01,496 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:01,497 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5111 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:01,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 16671 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:21:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2024-10-11 04:21:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3693. [2024-10-11 04:21:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7659154929577465) internal successors, (6269), 3557 states have internal predecessors, (6269), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:21:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6494 transitions. [2024-10-11 04:21:01,650 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6494 transitions. Word has length 152 [2024-10-11 04:21:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:01,650 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6494 transitions. [2024-10-11 04:21:01,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6494 transitions. [2024-10-11 04:21:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:01,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:01,653 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] [2024-10-11 04:21:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:21:01,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -28296950, now seen corresponding path program 1 times [2024-10-11 04:21:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565797231] [2024-10-11 04:21:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:01,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565797231] [2024-10-11 04:21:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565797231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:01,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376739332] [2024-10-11 04:21:01,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:01,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:01,921 INFO L87 Difference]: Start difference. First operand 3693 states and 6494 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:05,425 INFO L93 Difference]: Finished difference Result 7494 states and 12734 transitions. [2024-10-11 04:21:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:05,448 INFO L225 Difference]: With dead ends: 7494 [2024-10-11 04:21:05,448 INFO L226 Difference]: Without dead ends: 5939 [2024-10-11 04:21:05,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:05,457 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5339 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5357 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:05,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5357 Valid, 21749 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:21:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2024-10-11 04:21:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 4934. [2024-10-11 04:21:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4683 states have (on average 1.7258167841127483) internal successors, (8082), 4694 states have internal predecessors, (8082), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 04:21:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 8489 transitions. [2024-10-11 04:21:05,846 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 8489 transitions. Word has length 152 [2024-10-11 04:21:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:05,846 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 8489 transitions. [2024-10-11 04:21:05,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 8489 transitions. [2024-10-11 04:21:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:05,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:05,852 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] [2024-10-11 04:21:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:21:05,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 918740936, now seen corresponding path program 1 times [2024-10-11 04:21:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204098564] [2024-10-11 04:21:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:06,109 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:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204098564] [2024-10-11 04:21:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204098564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423545726] [2024-10-11 04:21:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:06,112 INFO L87 Difference]: Start difference. First operand 4934 states and 8489 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:09,339 INFO L93 Difference]: Finished difference Result 11959 states and 20005 transitions. [2024-10-11 04:21:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:09,372 INFO L225 Difference]: With dead ends: 11959 [2024-10-11 04:21:09,372 INFO L226 Difference]: Without dead ends: 9163 [2024-10-11 04:21:09,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:09,385 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5338 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5356 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:09,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5356 Valid, 21749 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:21:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9163 states. [2024-10-11 04:21:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9163 to 7413. [2024-10-11 04:21:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 6946 states have (on average 1.6841347538151454) internal successors, (11698), 6965 states have internal predecessors, (11698), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 04:21:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 12487 transitions. [2024-10-11 04:21:09,824 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 12487 transitions. Word has length 152 [2024-10-11 04:21:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:09,824 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 12487 transitions. [2024-10-11 04:21:09,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 12487 transitions. [2024-10-11 04:21:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:09,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:09,830 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] [2024-10-11 04:21:09,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:21:09,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:09,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1780574538, now seen corresponding path program 1 times [2024-10-11 04:21:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816673324] [2024-10-11 04:21:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:09,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:10,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:10,073 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:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816673324] [2024-10-11 04:21:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816673324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:10,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:10,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261920042] [2024-10-11 04:21:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:10,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:10,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:10,076 INFO L87 Difference]: Start difference. First operand 7413 states and 12487 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:13,558 INFO L93 Difference]: Finished difference Result 20880 states and 34589 transitions. [2024-10-11 04:21:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:13,621 INFO L225 Difference]: With dead ends: 20880 [2024-10-11 04:21:13,622 INFO L226 Difference]: Without dead ends: 15605 [2024-10-11 04:21:13,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:13,648 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5337 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5355 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:13,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5355 Valid, 21749 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:21:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15605 states. [2024-10-11 04:21:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15605 to 12386. [2024-10-11 04:21:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 11487 states have (on average 1.649865064855924) internal successors, (18952), 11522 states have internal predecessors, (18952), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:21:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 20559 transitions. [2024-10-11 04:21:14,442 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 20559 transitions. Word has length 152 [2024-10-11 04:21:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:14,443 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 20559 transitions. [2024-10-11 04:21:14,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 20559 transitions. [2024-10-11 04:21:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:14,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:14,454 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] [2024-10-11 04:21:14,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:21:14,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:14,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -269834360, now seen corresponding path program 1 times [2024-10-11 04:21:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:14,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829261918] [2024-10-11 04:21:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:14,692 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:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829261918] [2024-10-11 04:21:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829261918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617002954] [2024-10-11 04:21:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:14,695 INFO L87 Difference]: Start difference. First operand 12386 states and 20559 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:16,995 INFO L93 Difference]: Finished difference Result 26016 states and 43196 transitions. [2024-10-11 04:21:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:21:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:17,065 INFO L225 Difference]: With dead ends: 26016 [2024-10-11 04:21:17,065 INFO L226 Difference]: Without dead ends: 15768 [2024-10-11 04:21:17,107 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:17,108 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 4970 mSDsluCounter, 16586 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4989 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:17,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4989 Valid, 20789 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:21:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15768 states. [2024-10-11 04:21:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15768 to 12386. [2024-10-11 04:21:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 11487 states have (on average 1.646992252111082) internal successors, (18919), 11522 states have internal predecessors, (18919), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:21:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 20526 transitions. [2024-10-11 04:21:17,831 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 20526 transitions. Word has length 152 [2024-10-11 04:21:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 20526 transitions. [2024-10-11 04:21:17,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 20526 transitions. [2024-10-11 04:21:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:17,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:17,843 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] [2024-10-11 04:21:17,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:21:17,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:17,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash 218212746, now seen corresponding path program 1 times [2024-10-11 04:21:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311628229] [2024-10-11 04:21:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:18,083 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,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311628229] [2024-10-11 04:21:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311628229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948432795] [2024-10-11 04:21:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:18,086 INFO L87 Difference]: Start difference. First operand 12386 states and 20526 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:22,822 INFO L93 Difference]: Finished difference Result 43169 states and 70985 transitions. [2024-10-11 04:21:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:21:22,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:22,949 INFO L225 Difference]: With dead ends: 43169 [2024-10-11 04:21:22,949 INFO L226 Difference]: Without dead ends: 32921 [2024-10-11 04:21:22,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:21:22,981 INFO L432 NwaCegarLoop]: 4408 mSDtfsCounter, 5728 mSDsluCounter, 17334 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5758 SdHoareTripleChecker+Valid, 21742 SdHoareTripleChecker+Invalid, 3336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:22,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5758 Valid, 21742 Invalid, 3336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:21:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32921 states. [2024-10-11 04:21:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32921 to 22332. [2024-10-11 04:21:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22332 states, 20601 states have (on average 1.6233677976797243) internal successors, (33443), 20668 states have internal predecessors, (33443), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 04:21:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22332 states to 22332 states and 36784 transitions. [2024-10-11 04:21:24,197 INFO L78 Accepts]: Start accepts. Automaton has 22332 states and 36784 transitions. Word has length 152 [2024-10-11 04:21:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 22332 states and 36784 transitions. [2024-10-11 04:21:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22332 states and 36784 transitions. [2024-10-11 04:21:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:21:24,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:24,213 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] [2024-10-11 04:21:24,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:21:24,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:24,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -874422456, now seen corresponding path program 1 times [2024-10-11 04:21:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212688538] [2024-10-11 04:21:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:21:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:21:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:21:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:24,442 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,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212688538] [2024-10-11 04:21:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212688538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87554802] [2024-10-11 04:21:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:24,444 INFO L87 Difference]: Start difference. First operand 22332 states and 36784 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:31,110 INFO L93 Difference]: Finished difference Result 82441 states and 135945 transitions. [2024-10-11 04:21:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:21:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-11 04:21:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:31,348 INFO L225 Difference]: With dead ends: 82441 [2024-10-11 04:21:31,348 INFO L226 Difference]: Without dead ends: 62247 [2024-10-11 04:21:31,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:21:31,421 INFO L432 NwaCegarLoop]: 4407 mSDtfsCounter, 5425 mSDsluCounter, 17331 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5442 SdHoareTripleChecker+Valid, 21738 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:31,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5442 Valid, 21738 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:21:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62247 states.