./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_label44+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ef6d9fd95a71cebdd37ca9ed44a21ae5d28bdad26eec5b7b5fe261fc1809e5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:19:01,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:19:01,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:19:01,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:19:01,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:19:01,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:19:01,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:19:01,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:19:01,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:19:01,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:19:01,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:19:01,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:19:01,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:19:01,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:19:01,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:19:01,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:19:01,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:19:01,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:19:01,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:19:01,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:19:01,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:19:01,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:19:01,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:19:01,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:19:01,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:19:01,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:19:01,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:19:01,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:19:01,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:19:01,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:19:01,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:19:01,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:19:01,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:01,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:19:01,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:19:01,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:19:01,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:19:01,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:19:01,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:19:01,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:19:01,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:19:01,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:19:01,256 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ef6d9fd95a71cebdd37ca9ed44a21ae5d28bdad26eec5b7b5fe261fc1809e5a [2024-10-11 04:19:01,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:19:01,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:19:01,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:19:01,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:19:01,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:19:01,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c [2024-10-11 04:19:03,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:19:03,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:19:03,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c [2024-10-11 04:19:03,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a848fd2d/f3dc4a101f0a4a0c8ecc040c41265aff/FLAGf72586e68 [2024-10-11 04:19:04,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a848fd2d/f3dc4a101f0a4a0c8ecc040c41265aff [2024-10-11 04:19:04,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:19:04,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:19:04,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:04,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:19:04,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:19:04,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d0c44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04, skipping insertion in model container [2024-10-11 04:19:04,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:19:06,201 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_label44+token_ring.13.cil-2.c[377340,377353] [2024-10-11 04:19:06,243 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_label44+token_ring.13.cil-2.c[383339,383352] [2024-10-11 04:19:06,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:06,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:19:07,327 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_label44+token_ring.13.cil-2.c[377340,377353] [2024-10-11 04:19:07,336 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_label44+token_ring.13.cil-2.c[383339,383352] [2024-10-11 04:19:07,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:07,436 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:19:07,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07 WrapperNode [2024-10-11 04:19:07,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:07,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:07,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:19:07,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:19:07,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:07,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,038 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-10-11 04:19:08,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:08,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:19:08,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:19:08,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:19:08,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,331 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:19:08,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:19:08,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:19:08,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:19:08,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:19:08,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (1/1) ... [2024-10-11 04:19:08,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:08,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:08,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:19:08,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:19:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:19:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:19:09,004 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:19:09,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:19:17,040 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-10-11 04:19:17,041 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:19:17,169 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:19:17,170 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 04:19:17,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:17 BoogieIcfgContainer [2024-10-11 04:19:17,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:19:17,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:19:17,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:19:17,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:19:17,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:19:04" (1/3) ... [2024-10-11 04:19:17,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c5410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:17, skipping insertion in model container [2024-10-11 04:19:17,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:07" (2/3) ... [2024-10-11 04:19:17,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c5410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:17, skipping insertion in model container [2024-10-11 04:19:17,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:17" (3/3) ... [2024-10-11 04:19:17,183 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.13.cil-2.c [2024-10-11 04:19:17,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:19:17,205 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:19:17,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:19:17,340 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;@21cd243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:19:17,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:19:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:19:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:17,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:17,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:17,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1072822453, now seen corresponding path program 1 times [2024-10-11 04:19:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190844098] [2024-10-11 04:19:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:18,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190844098] [2024-10-11 04:19:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190844098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:18,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:19:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94305661] [2024-10-11 04:19:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:18,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:19:18,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:19:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:19:18,234 INFO L87 Difference]: Start difference. First operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-11 04:19:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:21,026 INFO L93 Difference]: Finished difference Result 5122 states and 9562 transitions. [2024-10-11 04:19:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:19:21,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:21,059 INFO L225 Difference]: With dead ends: 5122 [2024-10-11 04:19:21,060 INFO L226 Difference]: Without dead ends: 2630 [2024-10-11 04:19:21,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:19:21,079 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 1048 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 16502 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:21,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 16502 Invalid, 1206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:19:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-11 04:19:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-11 04:19:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.8354378818737271) internal successors, (4506), 2457 states have internal predecessors, (4506), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:19:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4560 transitions. [2024-10-11 04:19:21,264 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4560 transitions. Word has length 171 [2024-10-11 04:19:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:21,265 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4560 transitions. [2024-10-11 04:19:21,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-11 04:19:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4560 transitions. [2024-10-11 04:19:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:21,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:21,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:19:21,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1643094259, now seen corresponding path program 1 times [2024-10-11 04:19:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8567665] [2024-10-11 04:19:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8567665] [2024-10-11 04:19:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8567665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:19:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581270964] [2024-10-11 04:19:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:21,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:19:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:19:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:19:21,685 INFO L87 Difference]: Start difference. First operand 2490 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-11 04:19:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:23,702 INFO L93 Difference]: Finished difference Result 2984 states and 5386 transitions. [2024-10-11 04:19:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:19:23,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:23,718 INFO L225 Difference]: With dead ends: 2984 [2024-10-11 04:19:23,718 INFO L226 Difference]: Without dead ends: 2630 [2024-10-11 04:19:23,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:19:23,723 INFO L432 NwaCegarLoop]: 4272 mSDtfsCounter, 1036 mSDsluCounter, 12217 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16489 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:23,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16489 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:19:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-11 04:19:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-11 04:19:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.835030549898167) internal successors, (4505), 2457 states have internal predecessors, (4505), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:19:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4559 transitions. [2024-10-11 04:19:23,817 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4559 transitions. Word has length 171 [2024-10-11 04:19:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:23,818 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4559 transitions. [2024-10-11 04:19:23,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-11 04:19:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4559 transitions. [2024-10-11 04:19:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:23,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:23,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:23,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:19:23,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:23,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1031825201, now seen corresponding path program 1 times [2024-10-11 04:19:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:23,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36452344] [2024-10-11 04:19:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:24,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36452344] [2024-10-11 04:19:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36452344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:24,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:19:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155298256] [2024-10-11 04:19:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:24,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:19:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:19:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:19:24,454 INFO L87 Difference]: Start difference. First operand 2490 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-11 04:19:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:27,805 INFO L93 Difference]: Finished difference Result 3491 states and 6239 transitions. [2024-10-11 04:19:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:19:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:27,822 INFO L225 Difference]: With dead ends: 3491 [2024-10-11 04:19:27,822 INFO L226 Difference]: Without dead ends: 3141 [2024-10-11 04:19:27,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:27,827 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 5542 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 16946 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:27,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 16946 Invalid, 2578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:19:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-11 04:19:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2862. [2024-10-11 04:19:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2798 states have (on average 1.812723373838456) internal successors, (5072), 2801 states have internal predecessors, (5072), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-11 04:19:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5173 transitions. [2024-10-11 04:19:27,938 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5173 transitions. Word has length 171 [2024-10-11 04:19:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:27,938 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5173 transitions. [2024-10-11 04:19:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-11 04:19:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5173 transitions. [2024-10-11 04:19:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:27,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:27,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:27,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:19:27,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:27,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 247523539, now seen corresponding path program 1 times [2024-10-11 04:19:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804743584] [2024-10-11 04:19:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:28,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804743584] [2024-10-11 04:19:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804743584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:28,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:28,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121897420] [2024-10-11 04:19:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:28,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:28,351 INFO L87 Difference]: Start difference. First operand 2862 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:33,003 INFO L93 Difference]: Finished difference Result 4396 states and 7749 transitions. [2024-10-11 04:19:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:33,027 INFO L225 Difference]: With dead ends: 4396 [2024-10-11 04:19:33,027 INFO L226 Difference]: Without dead ends: 3674 [2024-10-11 04:19:33,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:33,034 INFO L432 NwaCegarLoop]: 4449 mSDtfsCounter, 5591 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21912 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:33,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21912 Invalid, 4060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 04:19:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-11 04:19:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3205. [2024-10-11 04:19:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7933804627249357) internal successors, (5581), 3116 states have internal predecessors, (5581), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:19:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5728 transitions. [2024-10-11 04:19:33,211 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5728 transitions. Word has length 171 [2024-10-11 04:19:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:33,212 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5728 transitions. [2024-10-11 04:19:33,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5728 transitions. [2024-10-11 04:19:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:33,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:33,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:33,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:19:33,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:33,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -17123951, now seen corresponding path program 1 times [2024-10-11 04:19:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:33,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888959924] [2024-10-11 04:19:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:33,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:33,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888959924] [2024-10-11 04:19:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888959924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:33,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653984332] [2024-10-11 04:19:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:33,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:33,618 INFO L87 Difference]: Start difference. First operand 3205 states and 5728 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:36,191 INFO L93 Difference]: Finished difference Result 4759 states and 8350 transitions. [2024-10-11 04:19:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:36,211 INFO L225 Difference]: With dead ends: 4759 [2024-10-11 04:19:36,212 INFO L226 Difference]: Without dead ends: 3694 [2024-10-11 04:19:36,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:36,219 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5115 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5136 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:36,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5136 Valid, 20880 Invalid, 2114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:19:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-11 04:19:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3205. [2024-10-11 04:19:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7924164524421593) internal successors, (5578), 3116 states have internal predecessors, (5578), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:19:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5725 transitions. [2024-10-11 04:19:36,387 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5725 transitions. Word has length 171 [2024-10-11 04:19:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5725 transitions. [2024-10-11 04:19:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5725 transitions. [2024-10-11 04:19:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:36,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:36,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:19:36,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1340302897, now seen corresponding path program 1 times [2024-10-11 04:19:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190669766] [2024-10-11 04:19:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190669766] [2024-10-11 04:19:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190669766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384117043] [2024-10-11 04:19:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:36,759 INFO L87 Difference]: Start difference. First operand 3205 states and 5725 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:38,820 INFO L93 Difference]: Finished difference Result 4755 states and 8333 transitions. [2024-10-11 04:19:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:38,839 INFO L225 Difference]: With dead ends: 4755 [2024-10-11 04:19:38,839 INFO L226 Difference]: Without dead ends: 3690 [2024-10-11 04:19:38,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:38,848 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5276 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:38,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 16750 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:19:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-10-11 04:19:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3205. [2024-10-11 04:19:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.791452442159383) internal successors, (5575), 3116 states have internal predecessors, (5575), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:19:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5722 transitions. [2024-10-11 04:19:38,983 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5722 transitions. Word has length 171 [2024-10-11 04:19:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:38,983 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5722 transitions. [2024-10-11 04:19:38,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5722 transitions. [2024-10-11 04:19:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:38,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:38,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:38,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:19:38,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 556676561, now seen corresponding path program 1 times [2024-10-11 04:19:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296504475] [2024-10-11 04:19:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296504475] [2024-10-11 04:19:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296504475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:39,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905520770] [2024-10-11 04:19:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:39,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:39,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:39,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:39,326 INFO L87 Difference]: Start difference. First operand 3205 states and 5722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:41,113 INFO L93 Difference]: Finished difference Result 4751 states and 8316 transitions. [2024-10-11 04:19:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:41,133 INFO L225 Difference]: With dead ends: 4751 [2024-10-11 04:19:41,134 INFO L226 Difference]: Without dead ends: 3686 [2024-10-11 04:19:41,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:41,142 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5274 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:41,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 16750 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:19:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2024-10-11 04:19:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3205. [2024-10-11 04:19:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7904884318766068) internal successors, (5572), 3116 states have internal predecessors, (5572), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:19:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5719 transitions. [2024-10-11 04:19:41,334 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5719 transitions. Word has length 171 [2024-10-11 04:19:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:41,335 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5719 transitions. [2024-10-11 04:19:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5719 transitions. [2024-10-11 04:19:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:41,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:41,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:41,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:19:41,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 894964111, now seen corresponding path program 1 times [2024-10-11 04:19:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593715569] [2024-10-11 04:19:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593715569] [2024-10-11 04:19:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593715569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:41,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519416116] [2024-10-11 04:19:41,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:41,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:41,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:41,801 INFO L87 Difference]: Start difference. First operand 3205 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:45,393 INFO L93 Difference]: Finished difference Result 5709 states and 9880 transitions. [2024-10-11 04:19:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:45,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:45,415 INFO L225 Difference]: With dead ends: 5709 [2024-10-11 04:19:45,416 INFO L226 Difference]: Without dead ends: 4644 [2024-10-11 04:19:45,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:45,423 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 5674 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:45,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 21167 Invalid, 3358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [103 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:19:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-10-11 04:19:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3904. [2024-10-11 04:19:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7593924860111911) internal successors, (6603), 3759 states have internal predecessors, (6603), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-11 04:19:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6846 transitions. [2024-10-11 04:19:45,587 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6846 transitions. Word has length 171 [2024-10-11 04:19:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6846 transitions. [2024-10-11 04:19:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6846 transitions. [2024-10-11 04:19:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:45,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:45,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:19:45,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1321518609, now seen corresponding path program 1 times [2024-10-11 04:19:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669040879] [2024-10-11 04:19:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669040879] [2024-10-11 04:19:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669040879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247913044] [2024-10-11 04:19:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:45,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:45,890 INFO L87 Difference]: Start difference. First operand 3904 states and 6846 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:47,936 INFO L93 Difference]: Finished difference Result 6395 states and 10995 transitions. [2024-10-11 04:19:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:47,962 INFO L225 Difference]: With dead ends: 6395 [2024-10-11 04:19:47,963 INFO L226 Difference]: Without dead ends: 4631 [2024-10-11 04:19:47,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:47,972 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5273 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:47,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 16750 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:19:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-11 04:19:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3904. [2024-10-11 04:19:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7580602184918732) internal successors, (6598), 3759 states have internal predecessors, (6598), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-11 04:19:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6841 transitions. [2024-10-11 04:19:48,136 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6841 transitions. Word has length 171 [2024-10-11 04:19:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:48,136 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6841 transitions. [2024-10-11 04:19:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6841 transitions. [2024-10-11 04:19:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:48,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:48,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:48,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:19:48,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 781089103, now seen corresponding path program 1 times [2024-10-11 04:19:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118599437] [2024-10-11 04:19:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118599437] [2024-10-11 04:19:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118599437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:48,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024171275] [2024-10-11 04:19:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:48,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:48,448 INFO L87 Difference]: Start difference. First operand 3904 states and 6841 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:52,379 INFO L93 Difference]: Finished difference Result 8250 states and 14007 transitions. [2024-10-11 04:19:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:52,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:52,403 INFO L225 Difference]: With dead ends: 8250 [2024-10-11 04:19:52,404 INFO L226 Difference]: Without dead ends: 6486 [2024-10-11 04:19:52,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:52,412 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5556 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:52,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21910 Invalid, 3928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:19:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2024-10-11 04:19:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5302. [2024-10-11 04:19:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 5035 states have (on average 1.717974180734856) internal successors, (8650), 5045 states have internal predecessors, (8650), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-11 04:19:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 9091 transitions. [2024-10-11 04:19:52,681 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 9091 transitions. Word has length 171 [2024-10-11 04:19:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:52,683 INFO L471 AbstractCegarLoop]: Abstraction has 5302 states and 9091 transitions. [2024-10-11 04:19:52,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 9091 transitions. [2024-10-11 04:19:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:52,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:52,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:52,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:19:52,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 625108561, now seen corresponding path program 1 times [2024-10-11 04:19:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805277622] [2024-10-11 04:19:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805277622] [2024-10-11 04:19:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805277622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:52,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863193784] [2024-10-11 04:19:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:52,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:52,983 INFO L87 Difference]: Start difference. First operand 5302 states and 9091 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:57,078 INFO L93 Difference]: Finished difference Result 13338 states and 22315 transitions. [2024-10-11 04:19:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:57,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:57,116 INFO L225 Difference]: With dead ends: 13338 [2024-10-11 04:19:57,116 INFO L226 Difference]: Without dead ends: 10176 [2024-10-11 04:19:57,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:57,134 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5561 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:57,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5581 Valid, 21910 Invalid, 3910 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:19:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10176 states. [2024-10-11 04:19:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10176 to 8103. [2024-10-11 04:19:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6780641767490794) internal successors, (12760), 7622 states have internal predecessors, (12760), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:19:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13615 transitions. [2024-10-11 04:19:57,774 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13615 transitions. Word has length 171 [2024-10-11 04:19:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:57,774 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13615 transitions. [2024-10-11 04:19:57,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13615 transitions. [2024-10-11 04:19:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:19:57,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:57,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:57,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:19:57,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1035718927, now seen corresponding path program 1 times [2024-10-11 04:19:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447171558] [2024-10-11 04:19:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:19:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:19:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:19:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:19:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447171558] [2024-10-11 04:19:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447171558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:58,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195163354] [2024-10-11 04:19:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:58,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:58,051 INFO L87 Difference]: Start difference. First operand 8103 states and 13615 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:19:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:59,953 INFO L93 Difference]: Finished difference Result 16213 states and 27056 transitions. [2024-10-11 04:19:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:19:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:59,995 INFO L225 Difference]: With dead ends: 16213 [2024-10-11 04:19:59,995 INFO L226 Difference]: Without dead ends: 10250 [2024-10-11 04:20:00,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:00,020 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5277 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:00,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 16750 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:20:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2024-10-11 04:20:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 8103. [2024-10-11 04:20:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.675828511309837) internal successors, (12743), 7622 states have internal predecessors, (12743), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:20:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13598 transitions. [2024-10-11 04:20:00,503 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13598 transitions. Word has length 171 [2024-10-11 04:20:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:00,504 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13598 transitions. [2024-10-11 04:20:00,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:20:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13598 transitions. [2024-10-11 04:20:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:20:00,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:00,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:20:00,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1100164275, now seen corresponding path program 1 times [2024-10-11 04:20:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475688923] [2024-10-11 04:20:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:20:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:20:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:20:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:20:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475688923] [2024-10-11 04:20:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475688923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:00,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180084486] [2024-10-11 04:20:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:00,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:00,779 INFO L87 Difference]: Start difference. First operand 8103 states and 13598 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:20:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:03,011 INFO L93 Difference]: Finished difference Result 16195 states and 26969 transitions. [2024-10-11 04:20:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:20:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:03,044 INFO L225 Difference]: With dead ends: 16195 [2024-10-11 04:20:03,044 INFO L226 Difference]: Without dead ends: 10232 [2024-10-11 04:20:03,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:03,063 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5112 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:03,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 20880 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:20:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2024-10-11 04:20:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8103. [2024-10-11 04:20:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6735928458705944) internal successors, (12726), 7622 states have internal predecessors, (12726), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:20:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13581 transitions. [2024-10-11 04:20:03,545 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13581 transitions. Word has length 171 [2024-10-11 04:20:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13581 transitions. [2024-10-11 04:20:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:20:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13581 transitions. [2024-10-11 04:20:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:20:03,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:03,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:03,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:20:03,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:03,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1030516401, now seen corresponding path program 1 times [2024-10-11 04:20:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:03,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57454702] [2024-10-11 04:20:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:20:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:20:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:20:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:20:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:03,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57454702] [2024-10-11 04:20:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57454702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100052197] [2024-10-11 04:20:03,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:03,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:03,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:03,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:03,845 INFO L87 Difference]: Start difference. First operand 8103 states and 13581 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:20:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:08,193 INFO L93 Difference]: Finished difference Result 23459 states and 38713 transitions. [2024-10-11 04:20:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:08,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:20:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:08,255 INFO L225 Difference]: With dead ends: 23459 [2024-10-11 04:20:08,255 INFO L226 Difference]: Without dead ends: 17496 [2024-10-11 04:20:08,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:20:08,278 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5542 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:08,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 21910 Invalid, 3833 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:20:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17496 states. [2024-10-11 04:20:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17496 to 13771. [2024-10-11 04:20:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 12808 states have (on average 1.6400687070580886) internal successors, (21006), 12842 states have internal predecessors, (21006), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-11 04:20:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 22743 transitions. [2024-10-11 04:20:09,151 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 22743 transitions. Word has length 171 [2024-10-11 04:20:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 22743 transitions. [2024-10-11 04:20:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-11 04:20:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 22743 transitions. [2024-10-11 04:20:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:20:09,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:09,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:09,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:20:09,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:09,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash -612627699, now seen corresponding path program 1 times [2024-10-11 04:20:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249542232] [2024-10-11 04:20:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:20:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:20:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:20:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:20:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:09,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249542232] [2024-10-11 04:20:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249542232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058981990] [2024-10-11 04:20:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:09,450 INFO L87 Difference]: Start difference. First operand 13771 states and 22743 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)