./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:08:15,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:08:15,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:08:15,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:08:15,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:08:15,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:08:15,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:08:15,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:08:15,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:08:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:08:15,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:08:15,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:08:15,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:08:15,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:08:15,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:08:15,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:08:15,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:08:15,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:08:15,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:08:15,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:08:15,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:08:15,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:08:15,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:08:15,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:08:15,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:08:15,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:08:15,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:08:15,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:08:15,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:08:15,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:08:15,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:08:15,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:08:15,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:15,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:08:15,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:08:15,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:08:15,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:08:15,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:08:15,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:08:15,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:08:15,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:08:15,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:08:15,554 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 [2024-11-11 22:08:15,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:08:15,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:08:15,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:08:15,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:08:15,841 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:08:15,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2024-11-11 22:08:17,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:08:17,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:08:17,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2024-11-11 22:08:18,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4626f55/dcffebfa10d047aa8b65f520d7f1c309/FLAG4ef9ce070 [2024-11-11 22:08:18,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4626f55/dcffebfa10d047aa8b65f520d7f1c309 [2024-11-11 22:08:18,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:08:18,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:08:18,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:18,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:08:18,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:08:18,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:18,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d070b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:18, skipping insertion in model container [2024-11-11 22:08:18,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:18" (1/1) ... [2024-11-11 22:08:18,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:08:19,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2024-11-11 22:08:19,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2024-11-11 22:08:20,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:20,237 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:08:21,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2024-11-11 22:08:21,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2024-11-11 22:08:21,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:21,119 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:08:21,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21 WrapperNode [2024-11-11 22:08:21,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:21,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:21,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:08:21,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:08:21,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,604 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-11-11 22:08:21,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:21,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:08:21,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:08:21,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:08:21,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:08:21,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:21,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:08:22,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:08:22,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:08:22,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:08:22,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (1/1) ... [2024-11-11 22:08:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:08:22,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:08:22,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:08:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:08:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:08:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:08:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:08:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:08:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:08:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:08:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:08:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:08:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:08:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:08:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:08:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:08:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:08:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:08:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:08:22,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:08:22,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:08:30,116 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-11-11 22:08:30,117 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:08:30,181 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:08:30,182 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-11 22:08:30,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:30 BoogieIcfgContainer [2024-11-11 22:08:30,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:08:30,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:08:30,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:08:30,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:08:30,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:08:18" (1/3) ... [2024-11-11 22:08:30,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a19e062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:30, skipping insertion in model container [2024-11-11 22:08:30,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:21" (2/3) ... [2024-11-11 22:08:30,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a19e062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:30, skipping insertion in model container [2024-11-11 22:08:30,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:30" (3/3) ... [2024-11-11 22:08:30,193 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.10.cil-2.c [2024-11-11 22:08:30,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:08:30,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:08:30,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:08:30,349 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;@51c2e091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:08:30,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:08:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 22:08:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:30,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:30,387 INFO L218 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] [2024-11-11 22:08:30,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2034921809, now seen corresponding path program 1 times [2024-11-11 22:08:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736843452] [2024-11-11 22:08:30,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736843452] [2024-11-11 22:08:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736843452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:08:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979049908] [2024-11-11 22:08:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:08:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:08:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:08:31,242 INFO L87 Difference]: Start difference. First operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 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-11-11 22:08:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:32,929 INFO L93 Difference]: Finished difference Result 5162 states and 9468 transitions. [2024-11-11 22:08:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:08:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:32,970 INFO L225 Difference]: With dead ends: 5162 [2024-11-11 22:08:32,971 INFO L226 Difference]: Without dead ends: 2579 [2024-11-11 22:08:32,984 INFO L434 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-11-11 22:08:32,987 INFO L435 NwaCegarLoop]: 4337 mSDtfsCounter, 899 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:32,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 16772 Invalid, 931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:08:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-11-11 22:08:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2459. [2024-11-11 22:08:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2427 states have (on average 1.826534816646065) internal successors, (4433), 2429 states have internal predecessors, (4433), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 22:08:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2024-11-11 22:08:33,149 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 156 [2024-11-11 22:08:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:33,150 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2024-11-11 22:08:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 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-11-11 22:08:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2024-11-11 22:08:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:33,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:33,155 INFO L218 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] [2024-11-11 22:08:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:08:33,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1833490989, now seen corresponding path program 1 times [2024-11-11 22:08:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400524136] [2024-11-11 22:08:33,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400524136] [2024-11-11 22:08:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400524136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:33,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:33,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824498149] [2024-11-11 22:08:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:33,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:33,649 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:37,384 INFO L93 Difference]: Finished difference Result 3374 states and 5955 transitions. [2024-11-11 22:08:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:37,404 INFO L225 Difference]: With dead ends: 3374 [2024-11-11 22:08:37,405 INFO L226 Difference]: Without dead ends: 3054 [2024-11-11 22:08:37,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:37,409 INFO L435 NwaCegarLoop]: 4460 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22009 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:37,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22009 Invalid, 3229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3167 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:08:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-11-11 22:08:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2797. [2024-11-11 22:08:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2736 states have (on average 1.7978801169590644) internal successors, (4919), 2740 states have internal predecessors, (4919), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-11 22:08:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 5016 transitions. [2024-11-11 22:08:37,535 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 5016 transitions. Word has length 156 [2024-11-11 22:08:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 5016 transitions. [2024-11-11 22:08:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 5016 transitions. [2024-11-11 22:08:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:37,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:37,546 INFO L218 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] [2024-11-11 22:08:37,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:08:37,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash 216050539, now seen corresponding path program 1 times [2024-11-11 22:08:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:37,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784959776] [2024-11-11 22:08:37,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784959776] [2024-11-11 22:08:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784959776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25075442] [2024-11-11 22:08:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:37,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:37,937 INFO L87 Difference]: Start difference. First operand 2797 states and 5016 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:41,317 INFO L93 Difference]: Finished difference Result 4542 states and 7800 transitions. [2024-11-11 22:08:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:41,336 INFO L225 Difference]: With dead ends: 4542 [2024-11-11 22:08:41,337 INFO L226 Difference]: Without dead ends: 3886 [2024-11-11 22:08:41,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:41,343 INFO L435 NwaCegarLoop]: 4406 mSDtfsCounter, 5285 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5302 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:41,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5302 Valid, 21880 Invalid, 2938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:08:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-11-11 22:08:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3421. [2024-11-11 22:08:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3308 states have (on average 1.7533252720677146) internal successors, (5800), 3314 states have internal predecessors, (5800), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-11-11 22:08:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5983 transitions. [2024-11-11 22:08:41,470 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5983 transitions. Word has length 156 [2024-11-11 22:08:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:41,471 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5983 transitions. [2024-11-11 22:08:41,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5983 transitions. [2024-11-11 22:08:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:41,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:41,474 INFO L218 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] [2024-11-11 22:08:41,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:08:41,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:41,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 579517037, now seen corresponding path program 1 times [2024-11-11 22:08:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:41,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028175520] [2024-11-11 22:08:41,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028175520] [2024-11-11 22:08:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028175520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549426753] [2024-11-11 22:08:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:41,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:41,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:41,736 INFO L87 Difference]: Start difference. First operand 3421 states and 5983 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:44,940 INFO L93 Difference]: Finished difference Result 6828 states and 11399 transitions. [2024-11-11 22:08:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:44,965 INFO L225 Difference]: With dead ends: 6828 [2024-11-11 22:08:44,966 INFO L226 Difference]: Without dead ends: 5548 [2024-11-11 22:08:44,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:44,974 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:08:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2024-11-11 22:08:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4671. [2024-11-11 22:08:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4454 states have (on average 1.698248765154917) internal successors, (7564), 4464 states have internal predecessors, (7564), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-11-11 22:08:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7925 transitions. [2024-11-11 22:08:45,167 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7925 transitions. Word has length 156 [2024-11-11 22:08:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 7925 transitions. [2024-11-11 22:08:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7925 transitions. [2024-11-11 22:08:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:45,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:45,171 INFO L218 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] [2024-11-11 22:08:45,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:08:45,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:45,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash 868336427, now seen corresponding path program 1 times [2024-11-11 22:08:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207330695] [2024-11-11 22:08:45,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207330695] [2024-11-11 22:08:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207330695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936064787] [2024-11-11 22:08:45,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:45,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:45,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:45,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:45,423 INFO L87 Difference]: Start difference. First operand 4671 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:48,571 INFO L93 Difference]: Finished difference Result 11398 states and 18611 transitions. [2024-11-11 22:08:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:48,619 INFO L225 Difference]: With dead ends: 11398 [2024-11-11 22:08:48,619 INFO L226 Difference]: Without dead ends: 8868 [2024-11-11 22:08:48,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:48,640 INFO L435 NwaCegarLoop]: 4456 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22005 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:48,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22005 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:08:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-11-11 22:08:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 7177. [2024-11-11 22:08:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 6752 states have (on average 1.643957345971564) internal successors, (11100), 6770 states have internal predecessors, (11100), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-11-11 22:08:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 11835 transitions. [2024-11-11 22:08:48,971 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 11835 transitions. Word has length 156 [2024-11-11 22:08:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 7177 states and 11835 transitions. [2024-11-11 22:08:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 11835 transitions. [2024-11-11 22:08:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:48,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:48,977 INFO L218 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] [2024-11-11 22:08:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:08:48,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 323463853, now seen corresponding path program 1 times [2024-11-11 22:08:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243992834] [2024-11-11 22:08:48,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243992834] [2024-11-11 22:08:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243992834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072608634] [2024-11-11 22:08:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:49,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:49,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:49,268 INFO L87 Difference]: Start difference. First operand 7177 states and 11835 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:52,782 INFO L93 Difference]: Finished difference Result 20536 states and 33091 transitions. [2024-11-11 22:08:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:52,847 INFO L225 Difference]: With dead ends: 20536 [2024-11-11 22:08:52,847 INFO L226 Difference]: Without dead ends: 15500 [2024-11-11 22:08:52,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:52,873 INFO L435 NwaCegarLoop]: 4459 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22008 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:52,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22008 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:08:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15500 states. [2024-11-11 22:08:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15500 to 12203. [2024-11-11 22:08:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 11362 states have (on average 1.6011265622249604) internal successors, (18192), 11396 states have internal predecessors, (18192), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-11-11 22:08:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19729 transitions. [2024-11-11 22:08:53,455 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19729 transitions. Word has length 156 [2024-11-11 22:08:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:53,456 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19729 transitions. [2024-11-11 22:08:53,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19729 transitions. [2024-11-11 22:08:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:53,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:53,466 INFO L218 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] [2024-11-11 22:08:53,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:08:53,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:53,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 998623979, now seen corresponding path program 1 times [2024-11-11 22:08:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:53,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546880715] [2024-11-11 22:08:53,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546880715] [2024-11-11 22:08:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546880715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:53,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645648063] [2024-11-11 22:08:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:53,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:53,708 INFO L87 Difference]: Start difference. First operand 12203 states and 19729 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:57,405 INFO L93 Difference]: Finished difference Result 38810 states and 62239 transitions. [2024-11-11 22:08:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:08:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:57,528 INFO L225 Difference]: With dead ends: 38810 [2024-11-11 22:08:57,529 INFO L226 Difference]: Without dead ends: 28748 [2024-11-11 22:08:57,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:08:57,719 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:57,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:08:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28748 states. [2024-11-11 22:08:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28748 to 22285. [2024-11-11 22:08:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5728701727149232) internal successors, (32420), 20678 states have internal predecessors, (32420), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-11 22:08:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35723 transitions. [2024-11-11 22:08:58,794 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35723 transitions. Word has length 156 [2024-11-11 22:08:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35723 transitions. [2024-11-11 22:08:58,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:08:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35723 transitions. [2024-11-11 22:08:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:08:58,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:58,812 INFO L218 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] [2024-11-11 22:08:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:08:58,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 50572013, now seen corresponding path program 1 times [2024-11-11 22:08:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224652367] [2024-11-11 22:08:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:08:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:08:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:08:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:08:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224652367] [2024-11-11 22:08:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224652367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779852868] [2024-11-11 22:08:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:59,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:59,063 INFO L87 Difference]: Start difference. First operand 22285 states and 35723 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:01,283 INFO L93 Difference]: Finished difference Result 49349 states and 79788 transitions. [2024-11-11 22:09:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:09:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:09:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:01,423 INFO L225 Difference]: With dead ends: 49349 [2024-11-11 22:09:01,423 INFO L226 Difference]: Without dead ends: 29203 [2024-11-11 22:09:01,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:09:01,498 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 5082 mSDsluCounter, 12542 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 16769 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:01,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 16769 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:09:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29203 states. [2024-11-11 22:09:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29203 to 22285. [2024-11-11 22:09:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5697166699010285) internal successors, (32355), 20678 states have internal predecessors, (32355), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-11 22:09:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35658 transitions. [2024-11-11 22:09:02,696 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35658 transitions. Word has length 156 [2024-11-11 22:09:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35658 transitions. [2024-11-11 22:09:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35658 transitions. [2024-11-11 22:09:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:09:02,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:02,712 INFO L218 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] [2024-11-11 22:09:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:09:02,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -534199637, now seen corresponding path program 1 times [2024-11-11 22:09:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267457487] [2024-11-11 22:09:02,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:09:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:09:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:09:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:09:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267457487] [2024-11-11 22:09:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267457487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934840513] [2024-11-11 22:09:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:02,950 INFO L87 Difference]: Start difference. First operand 22285 states and 35658 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:07,983 INFO L93 Difference]: Finished difference Result 75229 states and 120559 transitions. [2024-11-11 22:09:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:09:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:08,235 INFO L225 Difference]: With dead ends: 75229 [2024-11-11 22:09:08,235 INFO L226 Difference]: Without dead ends: 55085 [2024-11-11 22:09:08,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:09:08,301 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 5276 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5293 SdHoareTripleChecker+Valid, 22006 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:08,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5293 Valid, 22006 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:09:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2024-11-11 22:09:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 42638. [2024-11-11 22:09:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42638 states, 39301 states have (on average 1.5528866949950384) internal successors, (61030), 39431 states have internal predecessors, (61030), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 896 states have return successors, (4882), 2566 states have call predecessors, (4882), 2439 states have call successors, (4882) [2024-11-11 22:09:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42638 states to 42638 states and 68351 transitions. [2024-11-11 22:09:10,735 INFO L78 Accepts]: Start accepts. Automaton has 42638 states and 68351 transitions. Word has length 156 [2024-11-11 22:09:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:10,736 INFO L471 AbstractCegarLoop]: Abstraction has 42638 states and 68351 transitions. [2024-11-11 22:09:10,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42638 states and 68351 transitions. [2024-11-11 22:09:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:09:10,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:10,759 INFO L218 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] [2024-11-11 22:09:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:09:10,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -963857943, now seen corresponding path program 1 times [2024-11-11 22:09:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008043150] [2024-11-11 22:09:10,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:09:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:09:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:09:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:09:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008043150] [2024-11-11 22:09:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008043150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:11,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:11,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176744804] [2024-11-11 22:09:11,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:11,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:11,289 INFO L87 Difference]: Start difference. First operand 42638 states and 68351 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:17,896 INFO L93 Difference]: Finished difference Result 148320 states and 239808 transitions. [2024-11-11 22:09:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-11 22:09:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:18,602 INFO L225 Difference]: With dead ends: 148320 [2024-11-11 22:09:18,602 INFO L226 Difference]: Without dead ends: 107823 [2024-11-11 22:09:18,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:09:18,764 INFO L435 NwaCegarLoop]: 4407 mSDtfsCounter, 5302 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5319 SdHoareTripleChecker+Valid, 21881 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:18,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5319 Valid, 21881 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:09:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107823 states. [2024-11-11 22:09:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107823 to 83472. [2024-11-11 22:09:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83472 states, 76807 states have (on average 1.5437655422031846) internal successors, (118572), 77065 states have internal predecessors, (118572), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 1792 states have return successors, (11944), 5126 states have call predecessors, (11944), 4871 states have call successors, (11944) [2024-11-11 22:09:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83472 states to 83472 states and 135387 transitions. [2024-11-11 22:09:23,958 INFO L78 Accepts]: Start accepts. Automaton has 83472 states and 135387 transitions. Word has length 156 [2024-11-11 22:09:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 83472 states and 135387 transitions. [2024-11-11 22:09:23,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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-11-11 22:09:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83472 states and 135387 transitions. [2024-11-11 22:09:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:09:24,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:24,014 INFO L218 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] [2024-11-11 22:09:24,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:09:24,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:24,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1670454549, now seen corresponding path program 1 times [2024-11-11 22:09:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:24,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426760802] [2024-11-11 22:09:24,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:09:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:09:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:09:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:09:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426760802] [2024-11-11 22:09:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426760802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398257911] [2024-11-11 22:09:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:24,310 INFO L87 Difference]: Start difference. First operand 83472 states and 135387 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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)