./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:01:25,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:01:25,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:01:25,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:01:25,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:01:25,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:01:25,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:01:25,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:01:25,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:01:25,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:01:25,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:01:25,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:01:25,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:01:25,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:01:25,137 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:01:25,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:01:25,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:01:25,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:25,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:01:25,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:25,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:01:25,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:01:25,140 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 -> 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 [2025-01-09 06:01:25,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:01:25,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:01:25,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:01:25,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:01:25,417 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:01:25,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:01:26,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770f91586/76ae0573fd914303a1f895b1f87d4656/FLAGaa80843c2 [2025-01-09 06:01:27,342 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:01:27,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:01:27,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770f91586/76ae0573fd914303a1f895b1f87d4656/FLAGaa80843c2 [2025-01-09 06:01:27,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/770f91586/76ae0573fd914303a1f895b1f87d4656 [2025-01-09 06:01:27,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:01:27,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:01:27,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:01:27,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:01:27,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:01:27,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:01:27" (1/1) ... [2025-01-09 06:01:27,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c3927b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:27, skipping insertion in model container [2025-01-09 06:01:27,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:01:27" (1/1) ... [2025-01-09 06:01:27,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:01:28,055 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2025-01-09 06:01:28,134 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2025-01-09 06:01:28,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:01:28,657 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:01:28,716 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2025-01-09 06:01:28,723 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2025-01-09 06:01:28,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:01:29,007 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:01:29,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29 WrapperNode [2025-01-09 06:01:29,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:01:29,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:01:29,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:01:29,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:01:29,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,363 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5283 [2025-01-09 06:01:29,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:01:29,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:01:29,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:01:29,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:01:29,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,643 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 06:01:29,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:01:29,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:01:29,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:01:29,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:01:29,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (1/1) ... [2025-01-09 06:01:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:01:30,017 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 06:01:30,022 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 06:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:01:30,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:01:30,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:01:30,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:01:33,850 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-01-09 06:01:33,850 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:01:33,888 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:01:33,888 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 06:01:33,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:01:33 BoogieIcfgContainer [2025-01-09 06:01:33,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:01:33,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:01:33,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:01:33,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:01:33,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:01:27" (1/3) ... [2025-01-09 06:01:33,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a305dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:01:33, skipping insertion in model container [2025-01-09 06:01:33,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:29" (2/3) ... [2025-01-09 06:01:33,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a305dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:01:33, skipping insertion in model container [2025-01-09 06:01:33,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:01:33" (3/3) ... [2025-01-09 06:01:33,908 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:01:33,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:01:33,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 946 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 06:01:34,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:01:34,023 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;@4ced0e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:01:34,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:01:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 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:01:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:01:34,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:34,040 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 06:01:34,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 447802254, now seen corresponding path program 1 times [2025-01-09 06:01:34,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:34,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719476479] [2025-01-09 06:01:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:01:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:01:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:34,349 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 06:01:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719476479] [2025-01-09 06:01:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719476479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:34,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 06:01:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753195747] [2025-01-09 06:01:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:34,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 06:01:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:34,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 06:01:34,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 06:01:34,375 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 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 06:01:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:34,443 INFO L93 Difference]: Finished difference Result 1824 states and 3457 transitions. [2025-01-09 06:01:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 06:01:34,444 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 06:01:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:34,459 INFO L225 Difference]: With dead ends: 1824 [2025-01-09 06:01:34,459 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 06:01:34,463 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 06:01:34,469 INFO L435 NwaCegarLoop]: 1728 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, 1728 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 06:01:34,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 06:01:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 06:01:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 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:01:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2025-01-09 06:01:34,543 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2025-01-09 06:01:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2025-01-09 06:01:34,544 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 06:01:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2025-01-09 06:01:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:01:34,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:34,545 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 06:01:34,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:01:34,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 313788748, now seen corresponding path program 1 times [2025-01-09 06:01:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456957542] [2025-01-09 06:01:34,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:01:34,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:01:34,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:34,860 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 06:01:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456957542] [2025-01-09 06:01:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456957542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:01:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444686277] [2025-01-09 06:01:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:34,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:01:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:34,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:01:34,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:01:34,865 INFO L87 Difference]: Start difference. First operand 881 states and 1664 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 06:01:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:34,989 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2025-01-09 06:01:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:01:34,989 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 06:01:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:34,993 INFO L225 Difference]: With dead ends: 945 [2025-01-09 06:01:34,995 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 06:01:34,995 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 06:01:34,996 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 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 06:01:34,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 06:01:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 06:01:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 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:01:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2025-01-09 06:01:35,018 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2025-01-09 06:01:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:35,018 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2025-01-09 06:01:35,019 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 06:01:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2025-01-09 06:01:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 06:01:35,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:35,023 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] [2025-01-09 06:01:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:01:35,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:35,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -308547360, now seen corresponding path program 1 times [2025-01-09 06:01:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181026491] [2025-01-09 06:01:35,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:35,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 06:01:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 06:01:35,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:35,309 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 06:01:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181026491] [2025-01-09 06:01:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181026491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891762113] [2025-01-09 06:01:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:35,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:01:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:35,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:01:35,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:01:35,311 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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:01:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:40,571 INFO L93 Difference]: Finished difference Result 3136 states and 5912 transitions. [2025-01-09 06:01:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:01:40,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-01-09 06:01:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:40,580 INFO L225 Difference]: With dead ends: 3136 [2025-01-09 06:01:40,580 INFO L226 Difference]: Without dead ends: 2383 [2025-01-09 06:01:40,581 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 06:01:40,581 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2527 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:40,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 875 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 06:01:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-01-09 06:01:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-01-09 06:01:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2381 states have (on average 1.50314993700126) internal successors, (3579), 2382 states have internal predecessors, (3579), 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:01:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3579 transitions. [2025-01-09 06:01:40,621 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3579 transitions. Word has length 60 [2025-01-09 06:01:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3579 transitions. [2025-01-09 06:01:40,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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:01:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3579 transitions. [2025-01-09 06:01:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 06:01:40,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:40,623 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 06:01:40,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:01:40,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:40,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 763987068, now seen corresponding path program 1 times [2025-01-09 06:01:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:40,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679916649] [2025-01-09 06:01:40,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:40,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 06:01:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 06:01:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:40,901 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 06:01:40,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679916649] [2025-01-09 06:01:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679916649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:40,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245662619] [2025-01-09 06:01:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:40,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:40,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:40,902 INFO L87 Difference]: Start difference. First operand 2383 states and 3579 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 06:01:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,269 INFO L93 Difference]: Finished difference Result 3343 states and 5131 transitions. [2025-01-09 06:01:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 06:01:41,270 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 06:01:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,281 INFO L225 Difference]: With dead ends: 3343 [2025-01-09 06:01:41,282 INFO L226 Difference]: Without dead ends: 3283 [2025-01-09 06:01:41,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 06:01:41,285 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13456 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13456 SdHoareTripleChecker+Valid, 5839 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:41,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13456 Valid, 5839 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:01:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2025-01-09 06:01:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2441. [2025-01-09 06:01:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5059450594505945) internal successors, (3673), 2440 states have internal predecessors, (3673), 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:01:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3673 transitions. [2025-01-09 06:01:41,338 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3673 transitions. Word has length 90 [2025-01-09 06:01:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3673 transitions. [2025-01-09 06:01:41,339 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 06:01:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3673 transitions. [2025-01-09 06:01:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:41,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,342 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 06:01:41,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:01:41,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1663523956, now seen corresponding path program 1 times [2025-01-09 06:01:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35842097] [2025-01-09 06:01:41,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:41,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:41,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:41,452 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 06:01:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35842097] [2025-01-09 06:01:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35842097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747099660] [2025-01-09 06:01:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:41,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:41,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:41,454 INFO L87 Difference]: Start difference. First operand 2441 states and 3673 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 06:01:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,480 INFO L93 Difference]: Finished difference Result 2666 states and 4036 transitions. [2025-01-09 06:01:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,481 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 06:01:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,487 INFO L225 Difference]: With dead ends: 2666 [2025-01-09 06:01:41,487 INFO L226 Difference]: Without dead ends: 2548 [2025-01-09 06:01:41,488 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 06:01:41,489 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:41,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-01-09 06:01:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-01-09 06:01:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5098270440251573) internal successors, (3841), 2545 states have internal predecessors, (3841), 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:01:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3841 transitions. [2025-01-09 06:01:41,523 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3841 transitions. Word has length 92 [2025-01-09 06:01:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3841 transitions. [2025-01-09 06:01:41,524 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 06:01:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3841 transitions. [2025-01-09 06:01:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:41,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,525 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 06:01:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:01:41,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1597030444, now seen corresponding path program 1 times [2025-01-09 06:01:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611754758] [2025-01-09 06:01:41,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:41,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:41,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:42,001 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 06:01:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611754758] [2025-01-09 06:01:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611754758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830392621] [2025-01-09 06:01:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:42,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:42,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:42,003 INFO L87 Difference]: Start difference. First operand 2546 states and 3841 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 06:01:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:42,449 INFO L93 Difference]: Finished difference Result 2771 states and 4201 transitions. [2025-01-09 06:01:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:42,450 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 06:01:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:42,458 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 06:01:42,458 INFO L226 Difference]: Without dead ends: 2548 [2025-01-09 06:01:42,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 06:01:42,459 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 12132 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12132 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:42,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12132 Valid, 2254 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-01-09 06:01:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2025-01-09 06:01:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5090408805031446) internal successors, (3839), 2545 states have internal predecessors, (3839), 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:01:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3839 transitions. [2025-01-09 06:01:42,503 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3839 transitions. Word has length 92 [2025-01-09 06:01:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:42,504 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3839 transitions. [2025-01-09 06:01:42,504 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 06:01:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3839 transitions. [2025-01-09 06:01:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 06:01:42,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:42,505 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 06:01:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:01:42,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1616940962, now seen corresponding path program 1 times [2025-01-09 06:01:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343375853] [2025-01-09 06:01:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:42,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 06:01:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 06:01:42,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:42,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:42,730 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 06:01:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343375853] [2025-01-09 06:01:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343375853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:42,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:01:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271650024] [2025-01-09 06:01:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:42,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:01:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:42,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:01:42,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:01:42,731 INFO L87 Difference]: Start difference. First operand 2546 states and 3839 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 06:01:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:42,775 INFO L93 Difference]: Finished difference Result 2554 states and 3848 transitions. [2025-01-09 06:01:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:01:42,776 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 06:01:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:42,782 INFO L225 Difference]: With dead ends: 2554 [2025-01-09 06:01:42,782 INFO L226 Difference]: Without dead ends: 2552 [2025-01-09 06:01:42,783 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 06:01:42,784 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6391 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 06:01:42,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-01-09 06:01:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2025-01-09 06:01:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.507450980392157) internal successors, (3844), 2551 states have internal predecessors, (3844), 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:01:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3844 transitions. [2025-01-09 06:01:42,827 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3844 transitions. Word has length 93 [2025-01-09 06:01:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:42,828 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3844 transitions. [2025-01-09 06:01:42,828 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 06:01:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3844 transitions. [2025-01-09 06:01:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:42,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:42,829 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 06:01:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:01:42,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1163994508, now seen corresponding path program 1 times [2025-01-09 06:01:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714889785] [2025-01-09 06:01:42,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:42,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:42,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:42,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:42,935 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 06:01:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714889785] [2025-01-09 06:01:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714889785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:42,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:42,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:42,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355392302] [2025-01-09 06:01:42,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:42,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:42,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:42,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:42,937 INFO L87 Difference]: Start difference. First operand 2552 states and 3844 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 06:01:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:42,970 INFO L93 Difference]: Finished difference Result 2794 states and 4225 transitions. [2025-01-09 06:01:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:42,970 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 06:01:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:42,977 INFO L225 Difference]: With dead ends: 2794 [2025-01-09 06:01:42,977 INFO L226 Difference]: Without dead ends: 2670 [2025-01-09 06:01:42,978 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 06:01:42,978 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 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 06:01:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-01-09 06:01:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2668. [2025-01-09 06:01:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5097524381095273) internal successors, (4025), 2667 states have internal predecessors, (4025), 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:01:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4025 transitions. [2025-01-09 06:01:43,017 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4025 transitions. Word has length 94 [2025-01-09 06:01:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,017 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4025 transitions. [2025-01-09 06:01:43,017 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 06:01:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4025 transitions. [2025-01-09 06:01:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,019 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 06:01:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:01:43,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1203905420, now seen corresponding path program 1 times [2025-01-09 06:01:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507239113] [2025-01-09 06:01:43,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,087 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 06:01:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507239113] [2025-01-09 06:01:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507239113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140980670] [2025-01-09 06:01:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,088 INFO L87 Difference]: Start difference. First operand 2668 states and 4025 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 06:01:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,118 INFO L93 Difference]: Finished difference Result 3330 states and 5065 transitions. [2025-01-09 06:01:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,118 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 06:01:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,126 INFO L225 Difference]: With dead ends: 3330 [2025-01-09 06:01:43,126 INFO L226 Difference]: Without dead ends: 2987 [2025-01-09 06:01:43,127 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 06:01:43,128 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1783 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 06:01:43,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-01-09 06:01:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2985. [2025-01-09 06:01:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2983 states have (on average 1.5142474019443513) internal successors, (4517), 2984 states have internal predecessors, (4517), 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:01:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4517 transitions. [2025-01-09 06:01:43,173 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4517 transitions. Word has length 94 [2025-01-09 06:01:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,173 INFO L471 AbstractCegarLoop]: Abstraction has 2985 states and 4517 transitions. [2025-01-09 06:01:43,174 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 06:01:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4517 transitions. [2025-01-09 06:01:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,175 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 06:01:43,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:01:43,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1040990860, now seen corresponding path program 1 times [2025-01-09 06:01:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349532045] [2025-01-09 06:01:43,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,241 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 06:01:43,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349532045] [2025-01-09 06:01:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349532045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858896268] [2025-01-09 06:01:43,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,243 INFO L87 Difference]: Start difference. First operand 2985 states and 4517 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 06:01:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,276 INFO L93 Difference]: Finished difference Result 4257 states and 6499 transitions. [2025-01-09 06:01:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,277 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 06:01:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,286 INFO L225 Difference]: With dead ends: 4257 [2025-01-09 06:01:43,287 INFO L226 Difference]: Without dead ends: 3597 [2025-01-09 06:01:43,288 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 06:01:43,289 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1785 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 06:01:43,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-01-09 06:01:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3595. [2025-01-09 06:01:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 1.5176732535485666) internal successors, (5453), 3594 states have internal predecessors, (5453), 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:01:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5453 transitions. [2025-01-09 06:01:43,345 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5453 transitions. Word has length 94 [2025-01-09 06:01:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,346 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 5453 transitions. [2025-01-09 06:01:43,346 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 06:01:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5453 transitions. [2025-01-09 06:01:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,347 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 06:01:43,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:01:43,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash 461127540, now seen corresponding path program 1 times [2025-01-09 06:01:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349229075] [2025-01-09 06:01:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,409 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 06:01:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349229075] [2025-01-09 06:01:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349229075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983078061] [2025-01-09 06:01:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,410 INFO L87 Difference]: Start difference. First operand 3595 states and 5453 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 06:01:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,454 INFO L93 Difference]: Finished difference Result 6039 states and 9223 transitions. [2025-01-09 06:01:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,454 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 06:01:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,462 INFO L225 Difference]: With dead ends: 6039 [2025-01-09 06:01:43,462 INFO L226 Difference]: Without dead ends: 4769 [2025-01-09 06:01:43,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 06:01:43,464 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1781 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 06:01:43,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1781 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-01-09 06:01:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4767. [2025-01-09 06:01:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4765 states have (on average 1.5171038824763903) internal successors, (7229), 4766 states have internal predecessors, (7229), 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:01:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 7229 transitions. [2025-01-09 06:01:43,545 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 7229 transitions. Word has length 94 [2025-01-09 06:01:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,545 INFO L471 AbstractCegarLoop]: Abstraction has 4767 states and 7229 transitions. [2025-01-09 06:01:43,546 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 06:01:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 7229 transitions. [2025-01-09 06:01:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,547 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 06:01:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:01:43,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1754341260, now seen corresponding path program 1 times [2025-01-09 06:01:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729321568] [2025-01-09 06:01:43,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,609 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 06:01:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729321568] [2025-01-09 06:01:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729321568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454903700] [2025-01-09 06:01:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,611 INFO L87 Difference]: Start difference. First operand 4767 states and 7229 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 06:01:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,670 INFO L93 Difference]: Finished difference Result 9459 states and 14383 transitions. [2025-01-09 06:01:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,670 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 06:01:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,681 INFO L225 Difference]: With dead ends: 9459 [2025-01-09 06:01:43,682 INFO L226 Difference]: Without dead ends: 7017 [2025-01-09 06:01:43,685 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 06:01:43,686 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1783 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 06:01:43,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-01-09 06:01:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7015. [2025-01-09 06:01:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7015 states, 7013 states have (on average 1.5099101668330244) internal successors, (10589), 7014 states have internal predecessors, (10589), 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:01:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 10589 transitions. [2025-01-09 06:01:43,808 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 10589 transitions. Word has length 94 [2025-01-09 06:01:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,808 INFO L471 AbstractCegarLoop]: Abstraction has 7015 states and 10589 transitions. [2025-01-09 06:01:43,808 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 06:01:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 10589 transitions. [2025-01-09 06:01:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,809 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 06:01:43,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:01:43,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 26591604, now seen corresponding path program 1 times [2025-01-09 06:01:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412926975] [2025-01-09 06:01:43,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,869 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 06:01:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412926975] [2025-01-09 06:01:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412926975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514764421] [2025-01-09 06:01:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,871 INFO L87 Difference]: Start difference. First operand 7015 states and 10589 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 06:01:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,964 INFO L93 Difference]: Finished difference Result 16011 states and 24127 transitions. [2025-01-09 06:01:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,965 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 06:01:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,982 INFO L225 Difference]: With dead ends: 16011 [2025-01-09 06:01:43,983 INFO L226 Difference]: Without dead ends: 11321 [2025-01-09 06:01:43,990 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 06:01:43,990 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1785 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 06:01:43,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11321 states. [2025-01-09 06:01:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11321 to 11319. [2025-01-09 06:01:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11319 states, 11317 states have (on average 1.4955376866660777) internal successors, (16925), 11318 states have internal predecessors, (16925), 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:01:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11319 states to 11319 states and 16925 transitions. [2025-01-09 06:01:44,185 INFO L78 Accepts]: Start accepts. Automaton has 11319 states and 16925 transitions. Word has length 94 [2025-01-09 06:01:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 11319 states and 16925 transitions. [2025-01-09 06:01:44,186 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 06:01:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11319 states and 16925 transitions. [2025-01-09 06:01:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:44,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:44,187 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 06:01:44,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:01:44,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash -777134476, now seen corresponding path program 1 times [2025-01-09 06:01:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276607040] [2025-01-09 06:01:44,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:44,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:44,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:44,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:44,244 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 06:01:44,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276607040] [2025-01-09 06:01:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276607040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:44,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:44,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966669898] [2025-01-09 06:01:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:44,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:44,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:44,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:44,246 INFO L87 Difference]: Start difference. First operand 11319 states and 16925 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 06:01:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:44,540 INFO L93 Difference]: Finished difference Result 28539 states and 42463 transitions. [2025-01-09 06:01:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:44,541 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 06:01:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:44,574 INFO L225 Difference]: With dead ends: 28539 [2025-01-09 06:01:44,574 INFO L226 Difference]: Without dead ends: 19545 [2025-01-09 06:01:44,588 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 06:01:44,589 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1787 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 06:01:44,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19545 states. [2025-01-09 06:01:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19545 to 19543. [2025-01-09 06:01:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19543 states, 19541 states have (on average 1.475308326083619) internal successors, (28829), 19542 states have internal predecessors, (28829), 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:01:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 28829 transitions. [2025-01-09 06:01:44,958 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 28829 transitions. Word has length 94 [2025-01-09 06:01:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 19543 states and 28829 transitions. [2025-01-09 06:01:44,959 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 06:01:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 28829 transitions. [2025-01-09 06:01:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:44,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:44,960 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 06:01:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:01:44,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1148992372, now seen corresponding path program 1 times [2025-01-09 06:01:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896415492] [2025-01-09 06:01:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:44,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:44,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:44,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:44,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:45,017 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 06:01:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896415492] [2025-01-09 06:01:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896415492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89929372] [2025-01-09 06:01:45,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:45,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:45,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:45,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:45,019 INFO L87 Difference]: Start difference. First operand 19543 states and 28829 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 06:01:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:45,338 INFO L93 Difference]: Finished difference Result 52443 states and 76831 transitions. [2025-01-09 06:01:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:45,339 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 06:01:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:45,397 INFO L225 Difference]: With dead ends: 52443 [2025-01-09 06:01:45,397 INFO L226 Difference]: Without dead ends: 35225 [2025-01-09 06:01:45,421 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 06:01:45,422 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 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 06:01:45,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 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 06:01:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2025-01-09 06:01:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35223. [2025-01-09 06:01:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35221 states have (on average 1.4508673802560972) internal successors, (51101), 35222 states have internal predecessors, (51101), 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:01:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 51101 transitions. [2025-01-09 06:01:46,149 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 51101 transitions. Word has length 94 [2025-01-09 06:01:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 35223 states and 51101 transitions. [2025-01-09 06:01:46,150 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 06:01:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 51101 transitions. [2025-01-09 06:01:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:46,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:46,158 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:01:46,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:01:46,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash -429562990, now seen corresponding path program 1 times [2025-01-09 06:01:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:46,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18894648] [2025-01-09 06:01:46,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:46,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:46,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:01:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18894648] [2025-01-09 06:01:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18894648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:46,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206046685] [2025-01-09 06:01:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:46,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:46,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:46,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:46,382 INFO L87 Difference]: Start difference. First operand 35223 states and 51101 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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:01:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:50,055 INFO L93 Difference]: Finished difference Result 295209 states and 427174 transitions. [2025-01-09 06:01:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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:01:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:51,021 INFO L225 Difference]: With dead ends: 295209 [2025-01-09 06:01:51,022 INFO L226 Difference]: Without dead ends: 272167 [2025-01-09 06:01:51,093 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:01:51,094 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11712 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11712 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:51,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11712 Valid, 4973 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272167 states. [2025-01-09 06:01:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272167 to 63255. [2025-01-09 06:01:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63255 states, 63253 states have (on average 1.4432991320569775) internal successors, (91293), 63254 states have internal predecessors, (91293), 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:01:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 91293 transitions. [2025-01-09 06:01:54,356 INFO L78 Accepts]: Start accepts. Automaton has 63255 states and 91293 transitions. Word has length 119 [2025-01-09 06:01:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:54,357 INFO L471 AbstractCegarLoop]: Abstraction has 63255 states and 91293 transitions. [2025-01-09 06:01:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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:01:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 63255 states and 91293 transitions. [2025-01-09 06:01:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:54,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:54,376 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:01:54,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:01:54,377 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -469473902, now seen corresponding path program 1 times [2025-01-09 06:01:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256352037] [2025-01-09 06:01:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:54,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:54,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:54,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:54,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 06:01:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:54,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256352037] [2025-01-09 06:01:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256352037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:54,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23392795] [2025-01-09 06:01:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:54,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:54,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:54,868 INFO L87 Difference]: Start difference. First operand 63255 states and 91293 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:01:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:59,897 INFO L93 Difference]: Finished difference Result 328105 states and 474534 transitions. [2025-01-09 06:01:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:01:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:00,399 INFO L225 Difference]: With dead ends: 328105 [2025-01-09 06:02:00,399 INFO L226 Difference]: Without dead ends: 295207 [2025-01-09 06:02:00,466 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:02:00,466 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11788 mSDsluCounter, 3337 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11788 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:00,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11788 Valid, 5035 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:02:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295207 states. [2025-01-09 06:02:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295207 to 107671. [2025-01-09 06:02:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107671 states, 107669 states have (on average 1.4387521013476487) internal successors, (154909), 107670 states have internal predecessors, (154909), 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:02:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107671 states to 107671 states and 154909 transitions. [2025-01-09 06:02:04,880 INFO L78 Accepts]: Start accepts. Automaton has 107671 states and 154909 transitions. Word has length 119 [2025-01-09 06:02:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 107671 states and 154909 transitions. [2025-01-09 06:02:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:02:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 107671 states and 154909 transitions. [2025-01-09 06:02:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:02:04,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:04,890 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:02:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:02:04,891 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:04,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash -306559342, now seen corresponding path program 1 times [2025-01-09 06:02:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541606315] [2025-01-09 06:02:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:04,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:02:04,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:02:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:05,246 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 06:02:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541606315] [2025-01-09 06:02:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541606315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:05,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:05,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:02:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794303858] [2025-01-09 06:02:05,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:05,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:02:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:05,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:02:05,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:05,248 INFO L87 Difference]: Start difference. First operand 107671 states and 154909 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)