./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.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 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:58:48,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:58:48,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:58:48,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:58:48,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:58:48,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:58:48,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:58:48,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:58:48,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:58:48,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:58:48,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:58:48,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:58:48,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:58:48,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:58:48,698 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:58:48,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:58:48,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:58:48,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:58:48,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:58:48,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:58:48,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:58:48,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:58:48,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:58:48,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:58:48,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:58:48,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:58:48,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:58:48,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:58:48,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:58:48,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:58:48,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:58:48,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:58:48,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:58:48,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:58:48,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:58:48,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:58:48,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:58:48,708 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 -> 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 [2024-10-12 20:58:48,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:58:48,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:58:48,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:58:48,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:58:48,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:58:48,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2024-10-12 20:58:50,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:58:50,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:58:50,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2024-10-12 20:58:50,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979793abe/42a3a3b56d904d59975fb1def6179dcd/FLAG30c7e8f20 [2024-10-12 20:58:50,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979793abe/42a3a3b56d904d59975fb1def6179dcd [2024-10-12 20:58:50,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:58:50,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:58:50,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:58:50,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:58:50,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:58:50,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:58:50" (1/1) ... [2024-10-12 20:58:50,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bddb78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:50, skipping insertion in model container [2024-10-12 20:58:50,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:58:50" (1/1) ... [2024-10-12 20:58:51,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:58:52,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c[377340,377353] [2024-10-12 20:58:52,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c[383339,383352] [2024-10-12 20:58:52,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:58:52,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:58:53,120 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c[377340,377353] [2024-10-12 20:58:53,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c[383339,383352] [2024-10-12 20:58:53,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:58:53,195 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:58:53,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53 WrapperNode [2024-10-12 20:58:53,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:58:53,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:58:53,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:58:53,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:58:53,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,541 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-10-12 20:58:53,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:58:53,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:58:53,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:58:53,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:58:53,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,716 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:58:53,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:53,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:54,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:54,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:54,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:58:54,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:58:54,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:58:54,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:58:54,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (1/1) ... [2024-10-12 20:58:54,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:58:54,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:58:54,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:58:54,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:58:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:58:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:58:54,247 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:58:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:58:54,247 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:58:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:58:54,247 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:58:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:58:54,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:58:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:58:54,249 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:58:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:58:54,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:58:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:58:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:58:54,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:58:54,353 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:58:54,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:59:00,433 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-10-12 20:59:00,434 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:59:00,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:59:00,531 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-12 20:59:00,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:59:00 BoogieIcfgContainer [2024-10-12 20:59:00,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:59:00,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:59:00,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:59:00,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:59:00,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:58:50" (1/3) ... [2024-10-12 20:59:00,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285cfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:59:00, skipping insertion in model container [2024-10-12 20:59:00,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:58:53" (2/3) ... [2024-10-12 20:59:00,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285cfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:59:00, skipping insertion in model container [2024-10-12 20:59:00,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:59:00" (3/3) ... [2024-10-12 20:59:00,539 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.06.cil-2.c [2024-10-12 20:59:00,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:59:00,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:59:00,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:59:00,666 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;@5ca72fc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:59:00,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:59:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 20:59:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:00,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:00,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:00,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1188096418, now seen corresponding path program 1 times [2024-10-12 20:59:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074068040] [2024-10-12 20:59:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074068040] [2024-10-12 20:59:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074068040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:59:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913048656] [2024-10-12 20:59:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:01,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:59:01,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:59:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:59:01,205 INFO L87 Difference]: Start difference. First operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:02,175 INFO L93 Difference]: Finished difference Result 4728 states and 8858 transitions. [2024-10-12 20:59:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:59:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:02,202 INFO L225 Difference]: With dead ends: 4728 [2024-10-12 20:59:02,203 INFO L226 Difference]: Without dead ends: 2399 [2024-10-12 20:59:02,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:59:02,219 INFO L432 NwaCegarLoop]: 4143 mSDtfsCounter, 553 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 16215 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:02,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 16215 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:59:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-12 20:59:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2329. [2024-10-12 20:59:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2301 states have (on average 1.8457192524989134) internal successors, (4247), 2303 states have internal predecessors, (4247), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 20:59:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4287 transitions. [2024-10-12 20:59:02,341 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4287 transitions. Word has length 101 [2024-10-12 20:59:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:02,342 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4287 transitions. [2024-10-12 20:59:02,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4287 transitions. [2024-10-12 20:59:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:02,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:02,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:02,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:59:02,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1229807648, now seen corresponding path program 1 times [2024-10-12 20:59:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090006902] [2024-10-12 20:59:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090006902] [2024-10-12 20:59:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090006902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921820553] [2024-10-12 20:59:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:02,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:02,566 INFO L87 Difference]: Start difference. First operand 2329 states and 4287 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:04,582 INFO L93 Difference]: Finished difference Result 2881 states and 5198 transitions. [2024-10-12 20:59:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:59:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:04,602 INFO L225 Difference]: With dead ends: 2881 [2024-10-12 20:59:04,603 INFO L226 Difference]: Without dead ends: 2685 [2024-10-12 20:59:04,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:59:04,607 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 4743 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4756 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:04,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4756 Valid, 20974 Invalid, 2226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:59:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-10-12 20:59:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2536. [2024-10-12 20:59:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2483 states have (on average 1.829238824003222) internal successors, (4542), 2487 states have internal predecessors, (4542), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-12 20:59:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4623 transitions. [2024-10-12 20:59:04,696 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4623 transitions. Word has length 101 [2024-10-12 20:59:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:04,696 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 4623 transitions. [2024-10-12 20:59:04,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4623 transitions. [2024-10-12 20:59:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:04,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:04,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:04,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:59:04,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:04,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1188676830, now seen corresponding path program 1 times [2024-10-12 20:59:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344197127] [2024-10-12 20:59:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344197127] [2024-10-12 20:59:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344197127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638105280] [2024-10-12 20:59:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:04,938 INFO L87 Difference]: Start difference. First operand 2536 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:06,800 INFO L93 Difference]: Finished difference Result 3580 states and 6330 transitions. [2024-10-12 20:59:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:59:06,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:06,814 INFO L225 Difference]: With dead ends: 3580 [2024-10-12 20:59:06,814 INFO L226 Difference]: Without dead ends: 3179 [2024-10-12 20:59:06,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:59:06,821 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4768 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:06,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 20883 Invalid, 2026 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:59:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-12 20:59:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2914. [2024-10-12 20:59:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.8008519701810437) internal successors, (5073), 2823 states have internal predecessors, (5073), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-12 20:59:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5224 transitions. [2024-10-12 20:59:07,039 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5224 transitions. Word has length 101 [2024-10-12 20:59:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:07,040 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5224 transitions. [2024-10-12 20:59:07,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5224 transitions. [2024-10-12 20:59:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:07,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:07,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:07,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:59:07,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:07,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1227159520, now seen corresponding path program 1 times [2024-10-12 20:59:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275269824] [2024-10-12 20:59:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275269824] [2024-10-12 20:59:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275269824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:07,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069334952] [2024-10-12 20:59:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:07,230 INFO L87 Difference]: Start difference. First operand 2914 states and 5224 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:08,054 INFO L93 Difference]: Finished difference Result 3965 states and 6956 transitions. [2024-10-12 20:59:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:59:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:08,067 INFO L225 Difference]: With dead ends: 3965 [2024-10-12 20:59:08,067 INFO L226 Difference]: Without dead ends: 3184 [2024-10-12 20:59:08,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:59:08,071 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4644 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:08,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 16333 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:59:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2024-10-12 20:59:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2914. [2024-10-12 20:59:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7990770323038694) internal successors, (5068), 2823 states have internal predecessors, (5068), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-12 20:59:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5219 transitions. [2024-10-12 20:59:08,157 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5219 transitions. Word has length 101 [2024-10-12 20:59:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5219 transitions. [2024-10-12 20:59:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5219 transitions. [2024-10-12 20:59:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:08,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:08,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:59:08,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:08,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1742951582, now seen corresponding path program 1 times [2024-10-12 20:59:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706536968] [2024-10-12 20:59:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706536968] [2024-10-12 20:59:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706536968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016097930] [2024-10-12 20:59:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:08,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:08,287 INFO L87 Difference]: Start difference. First operand 2914 states and 5219 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:09,174 INFO L93 Difference]: Finished difference Result 3961 states and 6935 transitions. [2024-10-12 20:59:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:59:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:09,189 INFO L225 Difference]: With dead ends: 3961 [2024-10-12 20:59:09,190 INFO L226 Difference]: Without dead ends: 3180 [2024-10-12 20:59:09,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:59:09,196 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4642 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4656 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:09,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4656 Valid, 16333 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:59:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-12 20:59:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2914. [2024-10-12 20:59:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.797302094426695) internal successors, (5063), 2823 states have internal predecessors, (5063), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-12 20:59:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5214 transitions. [2024-10-12 20:59:09,305 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5214 transitions. Word has length 101 [2024-10-12 20:59:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5214 transitions. [2024-10-12 20:59:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5214 transitions. [2024-10-12 20:59:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:09,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:09,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:09,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:59:09,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:09,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash -176193632, now seen corresponding path program 1 times [2024-10-12 20:59:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765094085] [2024-10-12 20:59:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765094085] [2024-10-12 20:59:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765094085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250896062] [2024-10-12 20:59:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:09,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:09,592 INFO L87 Difference]: Start difference. First operand 2914 states and 5214 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:10,462 INFO L93 Difference]: Finished difference Result 3956 states and 6912 transitions. [2024-10-12 20:59:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:59:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:10,474 INFO L225 Difference]: With dead ends: 3956 [2024-10-12 20:59:10,475 INFO L226 Difference]: Without dead ends: 3175 [2024-10-12 20:59:10,478 INFO L431 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-10-12 20:59:10,481 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4555 mSDsluCounter, 16280 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 20387 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:10,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 20387 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:59:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-12 20:59:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2914. [2024-10-12 20:59:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7955271565495208) internal successors, (5058), 2823 states have internal predecessors, (5058), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-12 20:59:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5209 transitions. [2024-10-12 20:59:10,567 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5209 transitions. Word has length 101 [2024-10-12 20:59:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5209 transitions. [2024-10-12 20:59:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5209 transitions. [2024-10-12 20:59:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:10,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:10,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:59:10,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1234031710, now seen corresponding path program 1 times [2024-10-12 20:59:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880122398] [2024-10-12 20:59:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880122398] [2024-10-12 20:59:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880122398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193612100] [2024-10-12 20:59:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:10,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:10,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:10,714 INFO L87 Difference]: Start difference. First operand 2914 states and 5209 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:12,418 INFO L93 Difference]: Finished difference Result 4927 states and 8441 transitions. [2024-10-12 20:59:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:59:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:12,431 INFO L225 Difference]: With dead ends: 4927 [2024-10-12 20:59:12,432 INFO L226 Difference]: Without dead ends: 4148 [2024-10-12 20:59:12,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:59:12,434 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 4734 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 20973 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:12,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 20973 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:59:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-12 20:59:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3681. [2024-10-12 20:59:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3496 states have (on average 1.7502860411899313) internal successors, (6119), 3506 states have internal predecessors, (6119), 127 states have call successors, (127), 48 states have call predecessors, (127), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-12 20:59:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6416 transitions. [2024-10-12 20:59:12,551 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6416 transitions. Word has length 101 [2024-10-12 20:59:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:12,551 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6416 transitions. [2024-10-12 20:59:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6416 transitions. [2024-10-12 20:59:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:12,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:12,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:12,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:59:12,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:12,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1918433120, now seen corresponding path program 1 times [2024-10-12 20:59:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:12,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177177009] [2024-10-12 20:59:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:12,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177177009] [2024-10-12 20:59:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177177009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167865560] [2024-10-12 20:59:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:12,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:12,701 INFO L87 Difference]: Start difference. First operand 3681 states and 6416 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:14,410 INFO L93 Difference]: Finished difference Result 8286 states and 13806 transitions. [2024-10-12 20:59:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:14,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:14,448 INFO L225 Difference]: With dead ends: 8286 [2024-10-12 20:59:14,448 INFO L226 Difference]: Without dead ends: 6740 [2024-10-12 20:59:14,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:14,463 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4964 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:14,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 20963 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:59:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2024-10-12 20:59:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5206. [2024-10-12 20:59:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4853 states have (on average 1.6985369874304554) internal successors, (8243), 4871 states have internal predecessors, (8243), 239 states have call successors, (239), 96 states have call predecessors, (239), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-12 20:59:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 8834 transitions. [2024-10-12 20:59:14,845 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 8834 transitions. Word has length 101 [2024-10-12 20:59:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:14,845 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 8834 transitions. [2024-10-12 20:59:14,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 8834 transitions. [2024-10-12 20:59:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:14,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:14,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:14,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:59:14,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:14,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2136294430, now seen corresponding path program 1 times [2024-10-12 20:59:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108181868] [2024-10-12 20:59:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108181868] [2024-10-12 20:59:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108181868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823179141] [2024-10-12 20:59:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:15,042 INFO L87 Difference]: Start difference. First operand 5206 states and 8834 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:17,218 INFO L93 Difference]: Finished difference Result 13949 states and 22916 transitions. [2024-10-12 20:59:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:17,255 INFO L225 Difference]: With dead ends: 13949 [2024-10-12 20:59:17,255 INFO L226 Difference]: Without dead ends: 10878 [2024-10-12 20:59:17,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:17,270 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4907 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4927 SdHoareTripleChecker+Valid, 20965 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:17,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4927 Valid, 20965 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:59:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10878 states. [2024-10-12 20:59:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 8271. [2024-10-12 20:59:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 7590 states have (on average 1.6517786561264822) internal successors, (12537), 7624 states have internal predecessors, (12537), 455 states have call successors, (455), 192 states have call predecessors, (455), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-12 20:59:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 13754 transitions. [2024-10-12 20:59:17,804 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 13754 transitions. Word has length 101 [2024-10-12 20:59:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 8271 states and 13754 transitions. [2024-10-12 20:59:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 13754 transitions. [2024-10-12 20:59:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:17,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:17,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:17,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:59:17,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:17,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2109228828, now seen corresponding path program 1 times [2024-10-12 20:59:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:17,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171723049] [2024-10-12 20:59:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171723049] [2024-10-12 20:59:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171723049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807816365] [2024-10-12 20:59:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:17,927 INFO L87 Difference]: Start difference. First operand 8271 states and 13754 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:20,123 INFO L93 Difference]: Finished difference Result 25224 states and 41230 transitions. [2024-10-12 20:59:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:20,185 INFO L225 Difference]: With dead ends: 25224 [2024-10-12 20:59:20,186 INFO L226 Difference]: Without dead ends: 19088 [2024-10-12 20:59:20,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:20,208 INFO L432 NwaCegarLoop]: 4204 mSDtfsCounter, 4884 mSDsluCounter, 16679 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:20,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 20883 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:59:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19088 states. [2024-10-12 20:59:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19088 to 14401. [2024-10-12 20:59:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 13080 states have (on average 1.6175076452599388) internal successors, (21157), 13146 states have internal predecessors, (21157), 871 states have call successors, (871), 384 states have call predecessors, (871), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-12 20:59:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 23756 transitions. [2024-10-12 20:59:20,845 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 23756 transitions. Word has length 101 [2024-10-12 20:59:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:20,846 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 23756 transitions. [2024-10-12 20:59:20,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 23756 transitions. [2024-10-12 20:59:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:20,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:20,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:20,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:59:20,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:20,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash 108401570, now seen corresponding path program 1 times [2024-10-12 20:59:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75026849] [2024-10-12 20:59:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:20,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75026849] [2024-10-12 20:59:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75026849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:20,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:20,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:20,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807231271] [2024-10-12 20:59:20,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:20,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:20,984 INFO L87 Difference]: Start difference. First operand 14401 states and 23756 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:24,066 INFO L93 Difference]: Finished difference Result 47294 states and 77674 transitions. [2024-10-12 20:59:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:24,194 INFO L225 Difference]: With dead ends: 47294 [2024-10-12 20:59:24,195 INFO L226 Difference]: Without dead ends: 35028 [2024-10-12 20:59:24,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:24,244 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4775 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:24,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 20963 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:59:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2024-10-12 20:59:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 26661. [2024-10-12 20:59:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26661 states, 24092 states have (on average 1.596422048812884) internal successors, (38461), 24222 states have internal predecessors, (38461), 1671 states have call successors, (1671), 768 states have call predecessors, (1671), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-12 20:59:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 44246 transitions. [2024-10-12 20:59:25,670 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 44246 transitions. Word has length 101 [2024-10-12 20:59:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 26661 states and 44246 transitions. [2024-10-12 20:59:25,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 44246 transitions. [2024-10-12 20:59:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:25,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:25,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:59:25,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1842506020, now seen corresponding path program 1 times [2024-10-12 20:59:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893230692] [2024-10-12 20:59:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893230692] [2024-10-12 20:59:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893230692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721143776] [2024-10-12 20:59:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:25,933 INFO L87 Difference]: Start difference. First operand 26661 states and 44246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:30,229 INFO L93 Difference]: Finished difference Result 90474 states and 150842 transitions. [2024-10-12 20:59:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:30,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:30,453 INFO L225 Difference]: With dead ends: 90474 [2024-10-12 20:59:30,453 INFO L226 Difference]: Without dead ends: 65948 [2024-10-12 20:59:30,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:30,515 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4805 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:30,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 20963 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:59:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65948 states. [2024-10-12 20:59:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65948 to 51181. [2024-10-12 20:59:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51181 states, 46180 states have (on average 1.585036812472932) internal successors, (73197), 46438 states have internal predecessors, (73197), 3207 states have call successors, (3207), 1536 states have call predecessors, (3207), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-12 20:59:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51181 states to 51181 states and 86684 transitions. [2024-10-12 20:59:34,024 INFO L78 Accepts]: Start accepts. Automaton has 51181 states and 86684 transitions. Word has length 101 [2024-10-12 20:59:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 51181 states and 86684 transitions. [2024-10-12 20:59:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51181 states and 86684 transitions. [2024-10-12 20:59:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:34,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:34,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:34,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:59:34,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1565238430, now seen corresponding path program 1 times [2024-10-12 20:59:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:34,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442059603] [2024-10-12 20:59:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442059603] [2024-10-12 20:59:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442059603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:59:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957909668] [2024-10-12 20:59:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:34,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:59:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:59:34,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:59:34,176 INFO L87 Difference]: Start difference. First operand 51181 states and 86684 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:59:43,334 INFO L93 Difference]: Finished difference Result 174914 states and 299682 transitions. [2024-10-12 20:59:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:59:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-12 20:59:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:59:43,815 INFO L225 Difference]: With dead ends: 174914 [2024-10-12 20:59:43,815 INFO L226 Difference]: Without dead ends: 125868 [2024-10-12 20:59:43,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:59:43,934 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4756 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:59:43,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 20963 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:59:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125868 states. [2024-10-12 20:59:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125868 to 100221. [2024-10-12 20:59:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100221 states, 90484 states have (on average 1.5795610273639538) internal successors, (142925), 90998 states have internal predecessors, (142925), 6151 states have call successors, (6151), 3072 states have call predecessors, (6151), 3584 states have return successors, (26858), 6662 states have call predecessors, (26858), 6151 states have call successors, (26858) [2024-10-12 20:59:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100221 states to 100221 states and 175934 transitions. [2024-10-12 20:59:51,280 INFO L78 Accepts]: Start accepts. Automaton has 100221 states and 175934 transitions. Word has length 101 [2024-10-12 20:59:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:59:51,281 INFO L471 AbstractCegarLoop]: Abstraction has 100221 states and 175934 transitions. [2024-10-12 20:59:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:59:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 100221 states and 175934 transitions. [2024-10-12 20:59:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:59:51,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:59:51,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:59:51,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:59:51,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:59:51,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:59:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 818686308, now seen corresponding path program 1 times [2024-10-12 20:59:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:59:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344380857] [2024-10-12 20:59:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:59:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:59:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:59:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:59:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:59:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:59:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:59:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:59:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:59:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:59:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344380857] [2024-10-12 20:59:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344380857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:59:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:59:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:59:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611815180] [2024-10-12 20:59:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:59:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:59:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:59:51,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:59:51,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:59:51,516 INFO L87 Difference]: Start difference. First operand 100221 states and 175934 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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)