./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dfa3eba44a9bea88c5e5172bb0d59f15b4500aac9e1ca0a62eab29a7e65f8827 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:59:25,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:59:25,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:59:25,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:59:25,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:59:25,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:59:25,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:59:25,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:59:25,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:59:25,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:59:25,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:59:25,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:59:25,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:59:25,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:59:25,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:59:25,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:25,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:25,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:59:25,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:59:25,500 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> dfa3eba44a9bea88c5e5172bb0d59f15b4500aac9e1ca0a62eab29a7e65f8827 [2025-01-09 05:59:25,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:59:25,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:59:25,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:59:25,824 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:59:25,825 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:59:25,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:59:27,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36042f607/1befa9e911fe400a8c759af62b1a183c/FLAG018916617 [2025-01-09 05:59:27,518 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:59:27,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:59:27,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36042f607/1befa9e911fe400a8c759af62b1a183c/FLAG018916617 [2025-01-09 05:59:27,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36042f607/1befa9e911fe400a8c759af62b1a183c [2025-01-09 05:59:27,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:59:27,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:59:27,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:59:27,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:59:27,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:59:27,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:59:27" (1/1) ... [2025-01-09 05:59:27,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ab0e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:27, skipping insertion in model container [2025-01-09 05:59:27,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:59:27" (1/1) ... [2025-01-09 05:59:27,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:59:28,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[26925,26938] [2025-01-09 05:59:28,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[34215,34228] [2025-01-09 05:59:28,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:59:28,773 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:59:28,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[26925,26938] [2025-01-09 05:59:28,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[34215,34228] [2025-01-09 05:59:29,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:59:29,128 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:59:29,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29 WrapperNode [2025-01-09 05:59:29,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:59:29,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:59:29,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:59:29,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:59:29,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,511 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5286 [2025-01-09 05:59:29,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:59:29,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:59:29,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:59:29,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:59:29,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,769 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]. [2025-01-09 05:59:29,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:29,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:59:30,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:59:30,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:59:30,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:59:30,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (1/1) ... [2025-01-09 05:59:30,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:59:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:59:30,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:59:30,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:59:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:59:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:59:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:59:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:59:30,253 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:59:30,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:59:34,553 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-01-09 05:59:34,553 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:59:34,595 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:59:34,595 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:59:34,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:59:34 BoogieIcfgContainer [2025-01-09 05:59:34,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:59:34,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:59:34,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:59:34,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:59:34,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:59:27" (1/3) ... [2025-01-09 05:59:34,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc0c565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:59:34, skipping insertion in model container [2025-01-09 05:59:34,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:59:29" (2/3) ... [2025-01-09 05:59:34,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc0c565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:59:34, skipping insertion in model container [2025-01-09 05:59:34,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:59:34" (3/3) ... [2025-01-09 05:59:34,609 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:59:34,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:59:34,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:59:34,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:59:34,760 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;@5475d7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:59:34,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:59:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 05:59:34,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:34,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:34,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:34,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1459399979, now seen corresponding path program 1 times [2025-01-09 05:59:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889963710] [2025-01-09 05:59:34,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:34,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 05:59:34,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 05:59:34,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:34,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889963710] [2025-01-09 05:59:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889963710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:35,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:59:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906876413] [2025-01-09 05:59:35,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:59:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:35,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:59:35,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:59:35,086 INFO L87 Difference]: Start difference. First operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:35,150 INFO L93 Difference]: Finished difference Result 1828 states and 3463 transitions. [2025-01-09 05:59:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:59:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 05:59:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:35,165 INFO L225 Difference]: With dead ends: 1828 [2025-01-09 05:59:35,166 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 05:59:35,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:59:35,181 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:35,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 05:59:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 05:59:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2025-01-09 05:59:35,278 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2025-01-09 05:59:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:35,279 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2025-01-09 05:59:35,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2025-01-09 05:59:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 05:59:35,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:35,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:35,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:59:35,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:35,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1593413485, now seen corresponding path program 1 times [2025-01-09 05:59:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705570620] [2025-01-09 05:59:35,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 05:59:35,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 05:59:35,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:35,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705570620] [2025-01-09 05:59:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705570620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:59:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428471021] [2025-01-09 05:59:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:59:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:35,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:59:35,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:35,572 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:35,778 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2025-01-09 05:59:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:59:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 05:59:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:35,782 INFO L225 Difference]: With dead ends: 949 [2025-01-09 05:59:35,782 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 05:59:35,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:35,783 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:35,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 05:59:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 05:59:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2025-01-09 05:59:35,799 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2025-01-09 05:59:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:35,799 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2025-01-09 05:59:35,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2025-01-09 05:59:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:59:35,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:35,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:35,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:59:35,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash 883180108, now seen corresponding path program 1 times [2025-01-09 05:59:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268601451] [2025-01-09 05:59:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:59:35,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:59:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:36,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268601451] [2025-01-09 05:59:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268601451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:36,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572278931] [2025-01-09 05:59:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:36,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:59:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:36,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:59:36,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:59:36,047 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:41,576 INFO L93 Difference]: Finished difference Result 3138 states and 5915 transitions. [2025-01-09 05:59:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:59:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 05:59:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:41,586 INFO L225 Difference]: With dead ends: 3138 [2025-01-09 05:59:41,587 INFO L226 Difference]: Without dead ends: 2385 [2025-01-09 05:59:41,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:41,588 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2521 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:41,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 860 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 05:59:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-01-09 05:59:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-01-09 05:59:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2383 states have (on average 1.56105749055812) internal successors, (3720), 2384 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3720 transitions. [2025-01-09 05:59:41,638 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3720 transitions. Word has length 63 [2025-01-09 05:59:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:41,638 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3720 transitions. [2025-01-09 05:59:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3720 transitions. [2025-01-09 05:59:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:59:41,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:41,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:41,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:59:41,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:41,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1143215165, now seen corresponding path program 1 times [2025-01-09 05:59:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:41,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893211398] [2025-01-09 05:59:41,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:41,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:59:41,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:59:41,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:41,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:42,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893211398] [2025-01-09 05:59:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893211398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592411626] [2025-01-09 05:59:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:42,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:42,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:42,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:42,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:42,012 INFO L87 Difference]: Start difference. First operand 2385 states and 3720 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:42,488 INFO L93 Difference]: Finished difference Result 3377 states and 5320 transitions. [2025-01-09 05:59:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 05:59:42,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:59:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:42,505 INFO L225 Difference]: With dead ends: 3377 [2025-01-09 05:59:42,506 INFO L226 Difference]: Without dead ends: 3315 [2025-01-09 05:59:42,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:59:42,509 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13580 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13580 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:42,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13580 Valid, 5246 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:59:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2025-01-09 05:59:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2445. [2025-01-09 05:59:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.5624232501023332) internal successors, (3817), 2444 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3817 transitions. [2025-01-09 05:59:42,578 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3817 transitions. Word has length 90 [2025-01-09 05:59:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:42,579 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3817 transitions. [2025-01-09 05:59:42,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3817 transitions. [2025-01-09 05:59:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:59:42,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:42,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:59:42,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -467340741, now seen corresponding path program 1 times [2025-01-09 05:59:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82447685] [2025-01-09 05:59:42,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:42,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:59:42,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:59:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82447685] [2025-01-09 05:59:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82447685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207090469] [2025-01-09 05:59:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:43,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:43,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:43,241 INFO L87 Difference]: Start difference. First operand 2445 states and 3817 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:43,577 INFO L93 Difference]: Finished difference Result 2569 states and 4015 transitions. [2025-01-09 05:59:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:59:43,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:59:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:43,583 INFO L225 Difference]: With dead ends: 2569 [2025-01-09 05:59:43,584 INFO L226 Difference]: Without dead ends: 2447 [2025-01-09 05:59:43,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:59:43,585 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 6120 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6120 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:43,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6120 Valid, 2281 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-01-09 05:59:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2445. [2025-01-09 05:59:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.562013917314777) internal successors, (3816), 2444 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3816 transitions. [2025-01-09 05:59:43,616 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3816 transitions. Word has length 92 [2025-01-09 05:59:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:43,616 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3816 transitions. [2025-01-09 05:59:43,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3816 transitions. [2025-01-09 05:59:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:59:43,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:43,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:43,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:59:43,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -533834253, now seen corresponding path program 1 times [2025-01-09 05:59:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258124086] [2025-01-09 05:59:43,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:59:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:59:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:43,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258124086] [2025-01-09 05:59:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258124086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246308713] [2025-01-09 05:59:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:43,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:43,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:43,752 INFO L87 Difference]: Start difference. First operand 2445 states and 3816 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:43,781 INFO L93 Difference]: Finished difference Result 2678 states and 4189 transitions. [2025-01-09 05:59:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:59:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:43,788 INFO L225 Difference]: With dead ends: 2678 [2025-01-09 05:59:43,788 INFO L226 Difference]: Without dead ends: 2556 [2025-01-09 05:59:43,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:43,789 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:43,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-01-09 05:59:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2025-01-09 05:59:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5627450980392157) internal successors, (3985), 2551 states have internal predecessors, (3985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3985 transitions. [2025-01-09 05:59:43,838 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3985 transitions. Word has length 92 [2025-01-09 05:59:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3985 transitions. [2025-01-09 05:59:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3985 transitions. [2025-01-09 05:59:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:59:43,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:43,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:59:43,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2017383902, now seen corresponding path program 1 times [2025-01-09 05:59:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534500632] [2025-01-09 05:59:43,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:43,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:59:43,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:59:43,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:43,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534500632] [2025-01-09 05:59:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534500632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:44,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:44,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:59:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24986031] [2025-01-09 05:59:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:44,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:59:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:44,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:59:44,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:44,087 INFO L87 Difference]: Start difference. First operand 2552 states and 3985 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:44,121 INFO L93 Difference]: Finished difference Result 2560 states and 3994 transitions. [2025-01-09 05:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:59:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:59:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:44,130 INFO L225 Difference]: With dead ends: 2560 [2025-01-09 05:59:44,131 INFO L226 Difference]: Without dead ends: 2558 [2025-01-09 05:59:44,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:59:44,132 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:44,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-01-09 05:59:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2025-01-09 05:59:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5610328638497653) internal successors, (3990), 2557 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3990 transitions. [2025-01-09 05:59:44,171 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3990 transitions. Word has length 93 [2025-01-09 05:59:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3990 transitions. [2025-01-09 05:59:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3990 transitions. [2025-01-09 05:59:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:44,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:44,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:59:44,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 154071291, now seen corresponding path program 1 times [2025-01-09 05:59:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971087748] [2025-01-09 05:59:44,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:44,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:44,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:44,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:44,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971087748] [2025-01-09 05:59:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971087748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:44,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946973466] [2025-01-09 05:59:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:44,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:44,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:44,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,257 INFO L87 Difference]: Start difference. First operand 2558 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:44,290 INFO L93 Difference]: Finished difference Result 3012 states and 4702 transitions. [2025-01-09 05:59:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:44,299 INFO L225 Difference]: With dead ends: 3012 [2025-01-09 05:59:44,299 INFO L226 Difference]: Without dead ends: 2777 [2025-01-09 05:59:44,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,301 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:44,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-01-09 05:59:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2025-01-09 05:59:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 1.560403894698882) internal successors, (4327), 2774 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4327 transitions. [2025-01-09 05:59:44,348 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4327 transitions. Word has length 94 [2025-01-09 05:59:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:44,349 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4327 transitions. [2025-01-09 05:59:44,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4327 transitions. [2025-01-09 05:59:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:44,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:44,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:59:44,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2035911941, now seen corresponding path program 1 times [2025-01-09 05:59:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008741298] [2025-01-09 05:59:44,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:44,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:44,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:44,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:44,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008741298] [2025-01-09 05:59:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008741298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719828703] [2025-01-09 05:59:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:44,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:44,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,431 INFO L87 Difference]: Start difference. First operand 2775 states and 4327 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:44,466 INFO L93 Difference]: Finished difference Result 3647 states and 5685 transitions. [2025-01-09 05:59:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:44,477 INFO L225 Difference]: With dead ends: 3647 [2025-01-09 05:59:44,477 INFO L226 Difference]: Without dead ends: 3195 [2025-01-09 05:59:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,479 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:44,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-01-09 05:59:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2025-01-09 05:59:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3191 states have (on average 1.5571921027890943) internal successors, (4969), 3192 states have internal predecessors, (4969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4969 transitions. [2025-01-09 05:59:44,540 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4969 transitions. Word has length 94 [2025-01-09 05:59:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:44,540 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4969 transitions. [2025-01-09 05:59:44,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4969 transitions. [2025-01-09 05:59:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:44,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:59:44,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1772055557, now seen corresponding path program 1 times [2025-01-09 05:59:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712238902] [2025-01-09 05:59:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:44,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:44,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:44,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:44,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:44,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712238902] [2025-01-09 05:59:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712238902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574721367] [2025-01-09 05:59:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:44,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:44,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:44,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,623 INFO L87 Difference]: Start difference. First operand 3193 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:44,667 INFO L93 Difference]: Finished difference Result 4869 states and 7555 transitions. [2025-01-09 05:59:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:44,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:44,680 INFO L225 Difference]: With dead ends: 4869 [2025-01-09 05:59:44,680 INFO L226 Difference]: Without dead ends: 3999 [2025-01-09 05:59:44,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,682 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:44,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2025-01-09 05:59:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3997. [2025-01-09 05:59:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3995 states have (on average 1.5491864831038797) internal successors, (6189), 3996 states have internal predecessors, (6189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6189 transitions. [2025-01-09 05:59:44,783 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6189 transitions. Word has length 94 [2025-01-09 05:59:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:44,783 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 6189 transitions. [2025-01-09 05:59:44,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6189 transitions. [2025-01-09 05:59:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:44,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:44,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:44,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:59:44,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1545704955, now seen corresponding path program 1 times [2025-01-09 05:59:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:44,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94464768] [2025-01-09 05:59:44,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:44,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:44,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:44,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:44,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94464768] [2025-01-09 05:59:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94464768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126472767] [2025-01-09 05:59:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:44,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,875 INFO L87 Difference]: Start difference. First operand 3997 states and 6189 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:44,945 INFO L93 Difference]: Finished difference Result 7217 states and 11103 transitions. [2025-01-09 05:59:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:44,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:44,960 INFO L225 Difference]: With dead ends: 7217 [2025-01-09 05:59:44,960 INFO L226 Difference]: Without dead ends: 5543 [2025-01-09 05:59:44,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:44,965 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:44,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1782 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2025-01-09 05:59:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5541. [2025-01-09 05:59:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.5347535656255642) internal successors, (8501), 5540 states have internal predecessors, (8501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8501 transitions. [2025-01-09 05:59:45,191 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8501 transitions. Word has length 94 [2025-01-09 05:59:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:45,192 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8501 transitions. [2025-01-09 05:59:45,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8501 transitions. [2025-01-09 05:59:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:45,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:45,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:59:45,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash -968329477, now seen corresponding path program 1 times [2025-01-09 05:59:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573733401] [2025-01-09 05:59:45,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:45,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:45,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:45,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:45,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573733401] [2025-01-09 05:59:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573733401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37545779] [2025-01-09 05:59:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:45,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:45,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:45,294 INFO L87 Difference]: Start difference. First operand 5541 states and 8501 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:45,432 INFO L93 Difference]: Finished difference Result 11721 states and 17815 transitions. [2025-01-09 05:59:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:45,456 INFO L225 Difference]: With dead ends: 11721 [2025-01-09 05:59:45,456 INFO L226 Difference]: Without dead ends: 8503 [2025-01-09 05:59:45,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:45,465 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:45,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2025-01-09 05:59:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8501. [2025-01-09 05:59:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8499 states have (on average 1.5141781386045416) internal successors, (12869), 8500 states have internal predecessors, (12869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 12869 transitions. [2025-01-09 05:59:45,695 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 12869 transitions. Word has length 94 [2025-01-09 05:59:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:45,695 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 12869 transitions. [2025-01-09 05:59:45,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 12869 transitions. [2025-01-09 05:59:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:45,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:59:45,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:45,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -533793541, now seen corresponding path program 1 times [2025-01-09 05:59:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912498056] [2025-01-09 05:59:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:45,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:45,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:45,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912498056] [2025-01-09 05:59:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912498056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335393310] [2025-01-09 05:59:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:45,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:45,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:45,782 INFO L87 Difference]: Start difference. First operand 8501 states and 12869 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:45,915 INFO L93 Difference]: Finished difference Result 20345 states and 30471 transitions. [2025-01-09 05:59:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:45,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:45,940 INFO L225 Difference]: With dead ends: 20345 [2025-01-09 05:59:45,941 INFO L226 Difference]: Without dead ends: 14167 [2025-01-09 05:59:45,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:45,951 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:45,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2025-01-09 05:59:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2025-01-09 05:59:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.4893031137470876) internal successors, (21093), 14164 states have internal predecessors, (21093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 21093 transitions. [2025-01-09 05:59:46,197 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 21093 transitions. Word has length 94 [2025-01-09 05:59:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:46,197 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 21093 transitions. [2025-01-09 05:59:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 21093 transitions. [2025-01-09 05:59:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:59:46,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:46,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:59:46,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2096140795, now seen corresponding path program 1 times [2025-01-09 05:59:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102280398] [2025-01-09 05:59:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:59:46,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:59:46,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:46,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102280398] [2025-01-09 05:59:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102280398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509237960] [2025-01-09 05:59:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:46,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:46,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:46,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:46,371 INFO L87 Difference]: Start difference. First operand 14165 states and 21093 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:46,664 INFO L93 Difference]: Finished difference Result 36825 states and 54247 transitions. [2025-01-09 05:59:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 05:59:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:46,707 INFO L225 Difference]: With dead ends: 36825 [2025-01-09 05:59:46,707 INFO L226 Difference]: Without dead ends: 24983 [2025-01-09 05:59:46,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:46,725 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2025-01-09 05:59:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 24981. [2025-01-09 05:59:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24979 states have (on average 1.4619080027222868) internal successors, (36517), 24980 states have internal predecessors, (36517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36517 transitions. [2025-01-09 05:59:47,389 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36517 transitions. Word has length 94 [2025-01-09 05:59:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:47,389 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 36517 transitions. [2025-01-09 05:59:47,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36517 transitions. [2025-01-09 05:59:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 05:59:47,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:47,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:47,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:59:47,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:47,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash 228723286, now seen corresponding path program 1 times [2025-01-09 05:59:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933787192] [2025-01-09 05:59:47,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 05:59:47,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 05:59:47,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:47,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933787192] [2025-01-09 05:59:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933787192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957077424] [2025-01-09 05:59:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:59:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:47,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:59:47,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:47,447 INFO L87 Difference]: Start difference. First operand 24981 states and 36517 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:47,909 INFO L93 Difference]: Finished difference Result 48540 states and 71083 transitions. [2025-01-09 05:59:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:59:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 05:59:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:47,970 INFO L225 Difference]: With dead ends: 48540 [2025-01-09 05:59:47,970 INFO L226 Difference]: Without dead ends: 35993 [2025-01-09 05:59:47,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:59:47,987 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:47,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:59:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2025-01-09 05:59:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 35991. [2025-01-09 05:59:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 35989 states have (on average 1.4521937258606796) internal successors, (52263), 35990 states have internal predecessors, (52263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 52263 transitions. [2025-01-09 05:59:49,031 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 52263 transitions. Word has length 96 [2025-01-09 05:59:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:49,031 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 52263 transitions. [2025-01-09 05:59:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 52263 transitions. [2025-01-09 05:59:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:59:49,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:49,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:59:49,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:49,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1358034073, now seen corresponding path program 1 times [2025-01-09 05:59:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:49,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137523376] [2025-01-09 05:59:49,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:49,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:59:49,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:59:49,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:59:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137523376] [2025-01-09 05:59:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137523376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694296855] [2025-01-09 05:59:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:49,245 INFO L87 Difference]: Start difference. First operand 35991 states and 52263 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:53,222 INFO L93 Difference]: Finished difference Result 312105 states and 450864 transitions. [2025-01-09 05:59:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 05:59:53,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 05:59:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:53,911 INFO L225 Difference]: With dead ends: 312105 [2025-01-09 05:59:53,911 INFO L226 Difference]: Without dead ends: 278439 [2025-01-09 05:59:54,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:59:54,070 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11831 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11831 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:54,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11831 Valid, 4867 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278439 states. [2025-01-09 05:59:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278439 to 69655. [2025-01-09 05:59:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69655 states, 69653 states have (on average 1.4431395632636068) internal successors, (100519), 69654 states have internal predecessors, (100519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69655 states to 69655 states and 100519 transitions. [2025-01-09 05:59:57,929 INFO L78 Accepts]: Start accepts. Automaton has 69655 states and 100519 transitions. Word has length 119 [2025-01-09 05:59:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 69655 states and 100519 transitions. [2025-01-09 05:59:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 69655 states and 100519 transitions. [2025-01-09 05:59:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:59:57,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:57,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:59:57,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -831949159, now seen corresponding path program 1 times [2025-01-09 05:59:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800452575] [2025-01-09 05:59:57,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:57,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:59:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:59:57,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:59:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800452575] [2025-01-09 05:59:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800452575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:58,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 05:59:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833041221] [2025-01-09 05:59:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:58,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:59:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:58,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:59:58,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:59:58,160 INFO L87 Difference]: Start difference. First operand 69655 states and 100519 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:00:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:00:04,415 INFO L93 Difference]: Finished difference Result 345769 states and 499120 transitions. [2025-01-09 06:00:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:00:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 06:00:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:00:05,076 INFO L225 Difference]: With dead ends: 345769 [2025-01-09 06:00:05,076 INFO L226 Difference]: Without dead ends: 312103 [2025-01-09 06:00:05,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:00:05,332 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11879 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11879 SdHoareTripleChecker+Valid, 4812 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:00:05,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11879 Valid, 4812 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:00:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312103 states. [2025-01-09 06:00:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312103 to 120215. [2025-01-09 06:00:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120215 states, 120213 states have (on average 1.4356433996323192) internal successors, (172583), 120214 states have internal predecessors, (172583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:00:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120215 states to 120215 states and 172583 transitions. [2025-01-09 06:00:10,160 INFO L78 Accepts]: Start accepts. Automaton has 120215 states and 172583 transitions. Word has length 119 [2025-01-09 06:00:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:00:10,160 INFO L471 AbstractCegarLoop]: Abstraction has 120215 states and 172583 transitions. [2025-01-09 06:00:10,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:00:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 120215 states and 172583 transitions. [2025-01-09 06:00:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:00:10,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:10,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:00:10,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:00:10,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -568092775, now seen corresponding path program 1 times [2025-01-09 06:00:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073360941] [2025-01-09 06:00:10,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:10,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:00:10,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:00:10,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:00:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 06:00:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:00:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073360941] [2025-01-09 06:00:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073360941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:00:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:00:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:00:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307853960] [2025-01-09 06:00:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:00:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:00:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:00:10,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:00:10,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:00:10,379 INFO L87 Difference]: Start difference. First operand 120215 states and 172583 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)