./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_label43+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0e5700e5ac9932bdfeab3e919620f637ada74ab4466fc53a192536a8538b28f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:57:51,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:57:52,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:57:52,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:57:52,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:57:52,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:57:52,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:57:52,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:57:52,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:57:52,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:57:52,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:57:52,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:57:52,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:57:52,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:57:52,101 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:57:52,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:57:52,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:57:52,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:57:52,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:57:52,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:57:52,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:57:52,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:57:52,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:57:52,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:57:52,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:57:52,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:57:52,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:57:52,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:57:52,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:57:52,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:57:52,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:57:52,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:57:52,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:52,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:57:52,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:57:52,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:57:52,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:57:52,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:57:52,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:57:52,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:57:52,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:57:52,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:57:52,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0e5700e5ac9932bdfeab3e919620f637ada74ab4466fc53a192536a8538b28f [2024-10-12 20:57:52,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:57:52,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:57:52,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:57:52,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:57:52,360 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:57:52,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.12.cil-2.c [2024-10-12 20:57:53,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:57:54,392 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:57:54,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.12.cil-2.c [2024-10-12 20:57:54,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ee41bd2/959bd0557bcd4930a89a9e108c2de11d/FLAG9dc0db48e [2024-10-12 20:57:54,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ee41bd2/959bd0557bcd4930a89a9e108c2de11d [2024-10-12 20:57:54,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:57:54,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:57:54,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:54,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:57:54,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:57:54,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:54" (1/1) ... [2024-10-12 20:57:54,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2f84e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:54, skipping insertion in model container [2024-10-12 20:57:54,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:54" (1/1) ... [2024-10-12 20:57:55,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:57:56,546 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_label43+token_ring.12.cil-2.c[381679,381692] [2024-10-12 20:57:56,573 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_label43+token_ring.12.cil-2.c[383339,383352] [2024-10-12 20:57:56,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:56,863 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:57:57,669 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_label43+token_ring.12.cil-2.c[381679,381692] [2024-10-12 20:57:57,673 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_label43+token_ring.12.cil-2.c[383339,383352] [2024-10-12 20:57:57,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:57,756 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:57:57,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57 WrapperNode [2024-10-12 20:57:57,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:57,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:57,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:57:57,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:57:57,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:57,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,189 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13233 [2024-10-12 20:57:58,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:58,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:57:58,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:57:58,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:57:58,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,500 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-12 20:57:58,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:58,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:59,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:57:59,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:57:59,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:57:59,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:57:59,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (1/1) ... [2024-10-12 20:57:59,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:57:59,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:57:59,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:57:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:57:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:57:59,135 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:57:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:57:59,135 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:57:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:57:59,135 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:57:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:57:59,135 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:57:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:57:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:57:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:57:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:57:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:57:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:57:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:57:59,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:57:59,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:58:06,947 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2024-10-12 20:58:06,947 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:58:07,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:58:07,081 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-12 20:58:07,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:58:07 BoogieIcfgContainer [2024-10-12 20:58:07,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:58:07,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:58:07,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:58:07,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:58:07,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:57:54" (1/3) ... [2024-10-12 20:58:07,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2105b83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:58:07, skipping insertion in model container [2024-10-12 20:58:07,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:57" (2/3) ... [2024-10-12 20:58:07,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2105b83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:58:07, skipping insertion in model container [2024-10-12 20:58:07,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:58:07" (3/3) ... [2024-10-12 20:58:07,093 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.12.cil-2.c [2024-10-12 20:58:07,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:58:07,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:58:07,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:58:07,256 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;@58740525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:58:07,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:58:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:58:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:07,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:07,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:07,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:07,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash 280854231, now seen corresponding path program 1 times [2024-10-12 20:58:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153872814] [2024-10-12 20:58:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,012 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-12 20:58:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:08,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153872814] [2024-10-12 20:58:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153872814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:58:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867141425] [2024-10-12 20:58:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:08,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:58:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:58:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:58:08,060 INFO L87 Difference]: Start difference. First operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:10,360 INFO L93 Difference]: Finished difference Result 5068 states and 9466 transitions. [2024-10-12 20:58:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:58:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:10,398 INFO L225 Difference]: With dead ends: 5068 [2024-10-12 20:58:10,399 INFO L226 Difference]: Without dead ends: 2597 [2024-10-12 20:58:10,413 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-12 20:58:10,417 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 979 mSDsluCounter, 12204 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 16461 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:10,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 16461 Invalid, 1126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:58:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-12 20:58:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-12 20:58:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8368269625976161) internal successors, (4469), 2435 states have internal predecessors, (4469), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:58:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4521 transitions. [2024-10-12 20:58:10,696 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4521 transitions. Word has length 161 [2024-10-12 20:58:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:10,697 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4521 transitions. [2024-10-12 20:58:10,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4521 transitions. [2024-10-12 20:58:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:10,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:10,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:58:10,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 892123289, now seen corresponding path program 1 times [2024-10-12 20:58:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529352669] [2024-10-12 20:58:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,979 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-12 20:58:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529352669] [2024-10-12 20:58:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529352669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:10,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:58:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508239924] [2024-10-12 20:58:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:58:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:58:10,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:58:10,986 INFO L87 Difference]: Start difference. First operand 2467 states and 4521 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:12,843 INFO L93 Difference]: Finished difference Result 2930 states and 5294 transitions. [2024-10-12 20:58:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:58:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:12,857 INFO L225 Difference]: With dead ends: 2930 [2024-10-12 20:58:12,858 INFO L226 Difference]: Without dead ends: 2597 [2024-10-12 20:58:12,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:58:12,862 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 967 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 16448 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:12,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 16448 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:58:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-12 20:58:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-12 20:58:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8364159473900534) internal successors, (4468), 2435 states have internal predecessors, (4468), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:58:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4520 transitions. [2024-10-12 20:58:12,936 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4520 transitions. Word has length 161 [2024-10-12 20:58:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:12,937 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4520 transitions. [2024-10-12 20:58:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4520 transitions. [2024-10-12 20:58:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:12,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:12,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:12,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:58:12,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:12,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2079665061, now seen corresponding path program 1 times [2024-10-12 20:58:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379153502] [2024-10-12 20:58:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:13,315 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-12 20:58:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379153502] [2024-10-12 20:58:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379153502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:13,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:58:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212838929] [2024-10-12 20:58:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:13,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:58:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:58:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:58:13,319 INFO L87 Difference]: Start difference. First operand 2467 states and 4520 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:16,337 INFO L93 Difference]: Finished difference Result 3402 states and 6086 transitions. [2024-10-12 20:58:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:58:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:16,353 INFO L225 Difference]: With dead ends: 3402 [2024-10-12 20:58:16,354 INFO L226 Difference]: Without dead ends: 3074 [2024-10-12 20:58:16,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:58:16,359 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5433 mSDsluCounter, 12655 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5452 SdHoareTripleChecker+Valid, 16876 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:16,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5452 Valid, 16876 Invalid, 2405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:58:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2024-10-12 20:58:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2815. [2024-10-12 20:58:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2753 states have (on average 1.8147475481293134) internal successors, (4996), 2756 states have internal predecessors, (4996), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-12 20:58:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 5093 transitions. [2024-10-12 20:58:16,452 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 5093 transitions. Word has length 161 [2024-10-12 20:58:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:16,453 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 5093 transitions. [2024-10-12 20:58:16,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 5093 transitions. [2024-10-12 20:58:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:16,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:16,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:16,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:58:16,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:16,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1728519323, now seen corresponding path program 1 times [2024-10-12 20:58:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717763999] [2024-10-12 20:58:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,800 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-12 20:58:16,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:16,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717763999] [2024-10-12 20:58:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717763999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:16,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:16,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005225496] [2024-10-12 20:58:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:16,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:16,803 INFO L87 Difference]: Start difference. First operand 2815 states and 5093 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:20,643 INFO L93 Difference]: Finished difference Result 4247 states and 7492 transitions. [2024-10-12 20:58:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:20,660 INFO L225 Difference]: With dead ends: 4247 [2024-10-12 20:58:20,660 INFO L226 Difference]: Without dead ends: 3571 [2024-10-12 20:58:20,664 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-12 20:58:20,665 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5470 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5489 SdHoareTripleChecker+Valid, 21777 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:20,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5489 Valid, 21777 Invalid, 3786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 20:58:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2024-10-12 20:58:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3136. [2024-10-12 20:58:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3046 states have (on average 1.7957977675640184) internal successors, (5470), 3050 states have internal predecessors, (5470), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-12 20:58:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5611 transitions. [2024-10-12 20:58:20,788 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5611 transitions. Word has length 161 [2024-10-12 20:58:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:20,789 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5611 transitions. [2024-10-12 20:58:20,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5611 transitions. [2024-10-12 20:58:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:20,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:20,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:20,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:58:20,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -59350499, now seen corresponding path program 1 times [2024-10-12 20:58:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354219489] [2024-10-12 20:58:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:20,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:21,126 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-12 20:58:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:21,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354219489] [2024-10-12 20:58:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354219489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123097518] [2024-10-12 20:58:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:21,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:21,132 INFO L87 Difference]: Start difference. First operand 3136 states and 5611 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:24,730 INFO L93 Difference]: Finished difference Result 5485 states and 9538 transitions. [2024-10-12 20:58:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:24,753 INFO L225 Difference]: With dead ends: 5485 [2024-10-12 20:58:24,754 INFO L226 Difference]: Without dead ends: 4488 [2024-10-12 20:58:24,760 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-12 20:58:24,761 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5580 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5599 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:24,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5599 Valid, 21081 Invalid, 3190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [99 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:58:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2024-10-12 20:58:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3779. [2024-10-12 20:58:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.766859344894027) internal successors, (6419), 3639 states have internal predecessors, (6419), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:58:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6652 transitions. [2024-10-12 20:58:24,977 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6652 transitions. Word has length 161 [2024-10-12 20:58:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:24,977 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6652 transitions. [2024-10-12 20:58:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6652 transitions. [2024-10-12 20:58:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:24,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:24,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:24,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:58:24,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2099733595, now seen corresponding path program 1 times [2024-10-12 20:58:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:24,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353251238] [2024-10-12 20:58:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,346 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-12 20:58:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353251238] [2024-10-12 20:58:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353251238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:25,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:25,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232802821] [2024-10-12 20:58:25,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:25,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:25,350 INFO L87 Difference]: Start difference. First operand 3779 states and 6652 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:27,366 INFO L93 Difference]: Finished difference Result 6118 states and 10572 transitions. [2024-10-12 20:58:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:27,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:27,387 INFO L225 Difference]: With dead ends: 6118 [2024-10-12 20:58:27,387 INFO L226 Difference]: Without dead ends: 4478 [2024-10-12 20:58:27,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:58:27,397 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5192 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5212 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:27,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5212 Valid, 16690 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:58:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2024-10-12 20:58:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3779. [2024-10-12 20:58:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7654830718414534) internal successors, (6414), 3639 states have internal predecessors, (6414), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:58:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6647 transitions. [2024-10-12 20:58:27,580 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6647 transitions. Word has length 161 [2024-10-12 20:58:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:27,581 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6647 transitions. [2024-10-12 20:58:27,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6647 transitions. [2024-10-12 20:58:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:27,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:27,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:58:27,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2125585827, now seen corresponding path program 1 times [2024-10-12 20:58:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774021740] [2024-10-12 20:58:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:27,908 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-12 20:58:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774021740] [2024-10-12 20:58:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774021740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32736006] [2024-10-12 20:58:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:27,912 INFO L87 Difference]: Start difference. First operand 3779 states and 6647 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:29,688 INFO L93 Difference]: Finished difference Result 6107 states and 10536 transitions. [2024-10-12 20:58:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:29,714 INFO L225 Difference]: With dead ends: 6107 [2024-10-12 20:58:29,714 INFO L226 Difference]: Without dead ends: 4467 [2024-10-12 20:58:29,721 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-12 20:58:29,722 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5036 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:29,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 20809 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:58:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2024-10-12 20:58:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3779. [2024-10-12 20:58:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7641067987888797) internal successors, (6409), 3639 states have internal predecessors, (6409), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:58:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6642 transitions. [2024-10-12 20:58:29,872 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6642 transitions. Word has length 161 [2024-10-12 20:58:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:29,874 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6642 transitions. [2024-10-12 20:58:29,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6642 transitions. [2024-10-12 20:58:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:29,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:29,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:58:29,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -726632225, now seen corresponding path program 1 times [2024-10-12 20:58:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098462180] [2024-10-12 20:58:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:30,155 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-12 20:58:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:30,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098462180] [2024-10-12 20:58:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098462180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:30,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341385029] [2024-10-12 20:58:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:30,158 INFO L87 Difference]: Start difference. First operand 3779 states and 6642 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:33,622 INFO L93 Difference]: Finished difference Result 7839 states and 13357 transitions. [2024-10-12 20:58:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:33,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:33,643 INFO L225 Difference]: With dead ends: 7839 [2024-10-12 20:58:33,643 INFO L226 Difference]: Without dead ends: 6199 [2024-10-12 20:58:33,650 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-12 20:58:33,651 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5453 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3646 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5472 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:33,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5472 Valid, 21775 Invalid, 3709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3646 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:58:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2024-10-12 20:58:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5080. [2024-10-12 20:58:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7254251347988387) internal successors, (8320), 4832 states have internal predecessors, (8320), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 20:58:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8743 transitions. [2024-10-12 20:58:33,897 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8743 transitions. Word has length 161 [2024-10-12 20:58:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:33,899 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8743 transitions. [2024-10-12 20:58:33,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8743 transitions. [2024-10-12 20:58:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:33,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:33,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:33,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:58:33,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:33,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1950894621, now seen corresponding path program 1 times [2024-10-12 20:58:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967344661] [2024-10-12 20:58:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,159 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-12 20:58:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967344661] [2024-10-12 20:58:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967344661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:34,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725617033] [2024-10-12 20:58:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:34,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:34,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:34,165 INFO L87 Difference]: Start difference. First operand 5080 states and 8743 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:36,011 INFO L93 Difference]: Finished difference Result 9165 states and 15533 transitions. [2024-10-12 20:58:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:36,028 INFO L225 Difference]: With dead ends: 9165 [2024-10-12 20:58:36,028 INFO L226 Difference]: Without dead ends: 6224 [2024-10-12 20:58:36,038 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-12 20:58:36,038 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5035 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5055 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:36,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5055 Valid, 20809 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:58:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2024-10-12 20:58:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5080. [2024-10-12 20:58:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7235586893405226) internal successors, (8311), 4832 states have internal predecessors, (8311), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 20:58:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8734 transitions. [2024-10-12 20:58:36,262 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8734 transitions. Word has length 161 [2024-10-12 20:58:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:36,263 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8734 transitions. [2024-10-12 20:58:36,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8734 transitions. [2024-10-12 20:58:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:36,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:36,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:36,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:58:36,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:36,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1980606177, now seen corresponding path program 1 times [2024-10-12 20:58:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:36,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396868610] [2024-10-12 20:58:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:36,520 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-12 20:58:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396868610] [2024-10-12 20:58:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396868610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516352635] [2024-10-12 20:58:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:36,523 INFO L87 Difference]: Start difference. First operand 5080 states and 8734 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:40,351 INFO L93 Difference]: Finished difference Result 12574 states and 21066 transitions. [2024-10-12 20:58:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:40,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:40,385 INFO L225 Difference]: With dead ends: 12574 [2024-10-12 20:58:40,386 INFO L226 Difference]: Without dead ends: 9633 [2024-10-12 20:58:40,398 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-12 20:58:40,399 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5445 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:40,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 21775 Invalid, 3671 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 20:58:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2024-10-12 20:58:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 7692. [2024-10-12 20:58:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7692 states, 7210 states have (on average 1.6828016643550625) internal successors, (12133), 7228 states have internal predecessors, (12133), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-12 20:58:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7692 states to 7692 states and 12954 transitions. [2024-10-12 20:58:40,943 INFO L78 Accepts]: Start accepts. Automaton has 7692 states and 12954 transitions. Word has length 161 [2024-10-12 20:58:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:40,943 INFO L471 AbstractCegarLoop]: Abstraction has 7692 states and 12954 transitions. [2024-10-12 20:58:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7692 states and 12954 transitions. [2024-10-12 20:58:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:40,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:40,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:58:40,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1691786787, now seen corresponding path program 1 times [2024-10-12 20:58:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834680778] [2024-10-12 20:58:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:41,216 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-12 20:58:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834680778] [2024-10-12 20:58:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834680778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:41,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:41,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946164625] [2024-10-12 20:58:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:41,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:41,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:41,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:41,219 INFO L87 Difference]: Start difference. First operand 7692 states and 12954 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:45,027 INFO L93 Difference]: Finished difference Result 22060 states and 36616 transitions. [2024-10-12 20:58:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:45,083 INFO L225 Difference]: With dead ends: 22060 [2024-10-12 20:58:45,083 INFO L226 Difference]: Without dead ends: 16507 [2024-10-12 20:58:45,105 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-12 20:58:45,106 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5444 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5463 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:45,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5463 Valid, 21775 Invalid, 3658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:58:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2024-10-12 20:58:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 12929. [2024-10-12 20:58:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12929 states, 11999 states have (on average 1.6497208100675056) internal successors, (19795), 12033 states have internal predecessors, (19795), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-12 20:58:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 21466 transitions. [2024-10-12 20:58:45,814 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 21466 transitions. Word has length 161 [2024-10-12 20:58:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:45,814 INFO L471 AbstractCegarLoop]: Abstraction has 12929 states and 21466 transitions. [2024-10-12 20:58:45,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 21466 transitions. [2024-10-12 20:58:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:45,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:45,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:45,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:58:45,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:45,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2058307935, now seen corresponding path program 1 times [2024-10-12 20:58:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041399194] [2024-10-12 20:58:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:46,065 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-12 20:58:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041399194] [2024-10-12 20:58:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041399194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843855039] [2024-10-12 20:58:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:46,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:46,067 INFO L87 Difference]: Start difference. First operand 12929 states and 21466 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:50,372 INFO L93 Difference]: Finished difference Result 41031 states and 67906 transitions. [2024-10-12 20:58:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:50,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:50,475 INFO L225 Difference]: With dead ends: 41031 [2024-10-12 20:58:50,475 INFO L226 Difference]: Without dead ends: 30241 [2024-10-12 20:58:50,517 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-12 20:58:50,518 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5541 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 2997 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5560 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:50,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5560 Valid, 21081 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2997 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:58:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30241 states. [2024-10-12 20:58:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30241 to 23434. [2024-10-12 20:58:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6274065161051463) internal successors, (35165), 21674 states have internal predecessors, (35165), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 20:58:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38698 transitions. [2024-10-12 20:58:52,058 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38698 transitions. Word has length 161 [2024-10-12 20:58:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38698 transitions. [2024-10-12 20:58:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38698 transitions. [2024-10-12 20:58:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:52,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:52,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:58:52,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1561499235, now seen corresponding path program 1 times [2024-10-12 20:58:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336575965] [2024-10-12 20:58:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:52,354 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-12 20:58:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336575965] [2024-10-12 20:58:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336575965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040101465] [2024-10-12 20:58:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:52,357 INFO L87 Difference]: Start difference. First operand 23434 states and 38698 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:55,113 INFO L93 Difference]: Finished difference Result 51969 states and 86648 transitions. [2024-10-12 20:58:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:55,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:58:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:55,227 INFO L225 Difference]: With dead ends: 51969 [2024-10-12 20:58:55,227 INFO L226 Difference]: Without dead ends: 30674 [2024-10-12 20:58:55,275 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-12 20:58:55,276 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5194 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5214 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:55,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5214 Valid, 16690 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:58:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30674 states. [2024-10-12 20:58:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30674 to 23434. [2024-10-12 20:58:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6243983709737135) internal successors, (35100), 21674 states have internal predecessors, (35100), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 20:58:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38633 transitions. [2024-10-12 20:58:56,770 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38633 transitions. Word has length 161 [2024-10-12 20:58:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:56,770 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38633 transitions. [2024-10-12 20:58:56,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38633 transitions. [2024-10-12 20:58:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:58:56,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:56,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:58:56,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1785416095, now seen corresponding path program 1 times [2024-10-12 20:58:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133514782] [2024-10-12 20:58:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:58:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:58:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:58:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:58:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:57,034 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-12 20:58:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133514782] [2024-10-12 20:58:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133514782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531121186] [2024-10-12 20:58:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:57,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:57,036 INFO L87 Difference]: Start difference. First operand 23434 states and 38633 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:03,316 INFO L93 Difference]: Finished difference Result 88570 states and 146310 transitions. [2024-10-12 20:59:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:03,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-12 20:59:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:03,579 INFO L225 Difference]: With dead ends: 88570 [2024-10-12 20:59:03,579 INFO L226 Difference]: Without dead ends: 67275 [2024-10-12 20:59:03,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:03,663 INFO L432 NwaCegarLoop]: 4415 mSDtfsCounter, 5871 mSDsluCounter, 17353 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5903 SdHoareTripleChecker+Valid, 21768 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:03,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5903 Valid, 21768 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3515 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:59:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67275 states.