./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/eca-rers2012/Problem01_label45.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b8e8aa0b516ef9fd60c8444f7020a693e2ee03ee59580de825705d1497a8a117'] 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/eca-rers2012/Problem01_label45.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 b8e8aa0b516ef9fd60c8444f7020a693e2ee03ee59580de825705d1497a8a117 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:54:20,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:54:20,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:54:20,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:54:20,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:54:20,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:54:20,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:54:20,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:54:20,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:54:20,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:54:20,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:54:20,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:54:20,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:54:20,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:54:20,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:54:20,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:54:20,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:54:20,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:54:20,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:54:20,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:54:20,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:54:20,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:54:20,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:54:20,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:54:20,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:54:20,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:54:20,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:54:20,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:54:20,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:54:20,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:54:20,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:54:20,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:54:20,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:54:20,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:54:20,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:54:20,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:54:20,215 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 -> b8e8aa0b516ef9fd60c8444f7020a693e2ee03ee59580de825705d1497a8a117 [2024-11-06 18:54:20,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:54:20,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:54:20,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:54:20,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:54:20,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:54:20,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2024-11-06 18:54:21,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:54:22,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:54:22,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2024-11-06 18:54:22,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30bd493a/5436cea0945c4d8dbb7f8752e0a11007/FLAGf5bf586ea [2024-11-06 18:54:22,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30bd493a/5436cea0945c4d8dbb7f8752e0a11007 [2024-11-06 18:54:22,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:54:22,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:54:22,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:54:22,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:54:22,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:54:22,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f018fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22, skipping insertion in model container [2024-11-06 18:54:22,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:54:22,447 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/eca-rers2012/Problem01_label45.c[20099,20112] [2024-11-06 18:54:22,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:54:22,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:54:22,556 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/eca-rers2012/Problem01_label45.c[20099,20112] [2024-11-06 18:54:22,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:54:22,584 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:54:22,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22 WrapperNode [2024-11-06 18:54:22,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:54:22,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:54:22,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:54:22,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:54:22,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,652 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-06 18:54:22,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:54:22,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:54:22,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:54:22,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:54:22,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 18:54:22,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:54:22,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:54:22,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:54:22,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:54:22,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2024-11-06 18:54:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:54:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:54:22,812 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) [2024-11-06 18:54:22,816 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 [2024-11-06 18:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:54:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:54:22,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:54:22,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:54:24,015 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-06 18:54:24,016 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:54:24,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:54:24,029 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:54:24,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:24 BoogieIcfgContainer [2024-11-06 18:54:24,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:54:24,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:54:24,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:54:24,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:54:24,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:54:22" (1/3) ... [2024-11-06 18:54:24,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce2bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:24, skipping insertion in model container [2024-11-06 18:54:24,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (2/3) ... [2024-11-06 18:54:24,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce2bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:24, skipping insertion in model container [2024-11-06 18:54:24,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:24" (3/3) ... [2024-11-06 18:54:24,038 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2024-11-06 18:54:24,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:54:24,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:54:24,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:54:24,124 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;@46de960a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:54:24,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:54:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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) [2024-11-06 18:54:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 18:54:24,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:24,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:24,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:24,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:24,145 INFO L85 PathProgramCache]: Analyzing trace with hash -286323610, now seen corresponding path program 1 times [2024-11-06 18:54:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564548762] [2024-11-06 18:54:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:25,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564548762] [2024-11-06 18:54:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564548762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:25,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587444924] [2024-11-06 18:54:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:54:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:54:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:25,196 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 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) [2024-11-06 18:54:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:26,400 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2024-11-06 18:54:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:54:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 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 117 [2024-11-06 18:54:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:26,416 INFO L225 Difference]: With dead ends: 662 [2024-11-06 18:54:26,419 INFO L226 Difference]: Without dead ends: 397 [2024-11-06 18:54:26,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:54:26,427 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 351 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:26,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 77 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 18:54:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-06 18:54:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-06 18:54:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 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) [2024-11-06 18:54:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2024-11-06 18:54:26,497 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 117 [2024-11-06 18:54:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:26,498 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2024-11-06 18:54:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 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) [2024-11-06 18:54:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2024-11-06 18:54:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 18:54:26,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:26,501 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:26,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:54:26,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1466832461, now seen corresponding path program 1 times [2024-11-06 18:54:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144853969] [2024-11-06 18:54:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144853969] [2024-11-06 18:54:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144853969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:26,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525795167] [2024-11-06 18:54:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:26,948 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-11-06 18:54:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:27,635 INFO L93 Difference]: Finished difference Result 1018 states and 1433 transitions. [2024-11-06 18:54:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-06 18:54:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:27,641 INFO L225 Difference]: With dead ends: 1018 [2024-11-06 18:54:27,641 INFO L226 Difference]: Without dead ends: 659 [2024-11-06 18:54:27,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:27,646 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:27,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 83 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-06 18:54:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 397. [2024-11-06 18:54:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 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) [2024-11-06 18:54:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2024-11-06 18:54:27,679 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 124 [2024-11-06 18:54:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2024-11-06 18:54:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-11-06 18:54:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2024-11-06 18:54:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-06 18:54:27,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:27,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:27,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:54:27,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:27,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1990683701, now seen corresponding path program 1 times [2024-11-06 18:54:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383218312] [2024-11-06 18:54:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 18:54:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383218312] [2024-11-06 18:54:27,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383218312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368880149] [2024-11-06 18:54:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:27,843 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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) [2024-11-06 18:54:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:28,194 INFO L93 Difference]: Finished difference Result 923 states and 1105 transitions. [2024-11-06 18:54:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 132 [2024-11-06 18:54:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:28,197 INFO L225 Difference]: With dead ends: 923 [2024-11-06 18:54:28,197 INFO L226 Difference]: Without dead ends: 528 [2024-11-06 18:54:28,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:28,198 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:28,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 47 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-06 18:54:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-06 18:54:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 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) [2024-11-06 18:54:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions. [2024-11-06 18:54:28,226 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 132 [2024-11-06 18:54:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:28,226 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 617 transitions. [2024-11-06 18:54:28,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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) [2024-11-06 18:54:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions. [2024-11-06 18:54:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-06 18:54:28,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:28,229 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:54:28,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash -801126893, now seen corresponding path program 1 times [2024-11-06 18:54:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383133944] [2024-11-06 18:54:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 18:54:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383133944] [2024-11-06 18:54:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383133944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481859318] [2024-11-06 18:54:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:28,385 INFO L87 Difference]: Start difference. First operand 528 states and 617 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2024-11-06 18:54:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:28,775 INFO L93 Difference]: Finished difference Result 1578 states and 1846 transitions. [2024-11-06 18:54:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 141 [2024-11-06 18:54:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:28,780 INFO L225 Difference]: With dead ends: 1578 [2024-11-06 18:54:28,780 INFO L226 Difference]: Without dead ends: 1052 [2024-11-06 18:54:28,781 INFO L431 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 [2024-11-06 18:54:28,782 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:28,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-06 18:54:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2024-11-06 18:54:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1891304347826086) internal successors, (1094), 920 states have internal predecessors, (1094), 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) [2024-11-06 18:54:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1094 transitions. [2024-11-06 18:54:28,810 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1094 transitions. Word has length 141 [2024-11-06 18:54:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:28,810 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1094 transitions. [2024-11-06 18:54:28,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2024-11-06 18:54:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1094 transitions. [2024-11-06 18:54:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-06 18:54:28,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:28,814 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:28,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:54:28,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1793514564, now seen corresponding path program 1 times [2024-11-06 18:54:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423251046] [2024-11-06 18:54:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 18:54:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423251046] [2024-11-06 18:54:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423251046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:29,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303459868] [2024-11-06 18:54:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:29,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:29,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:29,016 INFO L87 Difference]: Start difference. First operand 921 states and 1094 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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) [2024-11-06 18:54:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:29,608 INFO L93 Difference]: Finished difference Result 2364 states and 2857 transitions. [2024-11-06 18:54:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:29,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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 147 [2024-11-06 18:54:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:29,615 INFO L225 Difference]: With dead ends: 2364 [2024-11-06 18:54:29,615 INFO L226 Difference]: Without dead ends: 1445 [2024-11-06 18:54:29,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:29,618 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:29,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 36 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-06 18:54:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2024-11-06 18:54:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1776649746192893) internal successors, (1392), 1182 states have internal predecessors, (1392), 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) [2024-11-06 18:54:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1392 transitions. [2024-11-06 18:54:29,656 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1392 transitions. Word has length 147 [2024-11-06 18:54:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:29,656 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1392 transitions. [2024-11-06 18:54:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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) [2024-11-06 18:54:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1392 transitions. [2024-11-06 18:54:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-06 18:54:29,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:29,660 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:54:29,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1768513183, now seen corresponding path program 1 times [2024-11-06 18:54:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801619260] [2024-11-06 18:54:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 18:54:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:29,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801619260] [2024-11-06 18:54:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801619260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:29,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:29,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443632206] [2024-11-06 18:54:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:29,880 INFO L87 Difference]: Start difference. First operand 1183 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-06 18:54:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:30,510 INFO L93 Difference]: Finished difference Result 2888 states and 3355 transitions. [2024-11-06 18:54:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 161 [2024-11-06 18:54:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:30,520 INFO L225 Difference]: With dead ends: 2888 [2024-11-06 18:54:30,521 INFO L226 Difference]: Without dead ends: 1576 [2024-11-06 18:54:30,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:30,524 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 249 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:30,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 40 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-06 18:54:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-06 18:54:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.134349030470914) internal successors, (1638), 1444 states have internal predecessors, (1638), 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) [2024-11-06 18:54:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1638 transitions. [2024-11-06 18:54:30,567 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1638 transitions. Word has length 161 [2024-11-06 18:54:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:30,567 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1638 transitions. [2024-11-06 18:54:30,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-06 18:54:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1638 transitions. [2024-11-06 18:54:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-06 18:54:30,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:30,572 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 18:54:30,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:54:30,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -113108252, now seen corresponding path program 1 times [2024-11-06 18:54:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802948377] [2024-11-06 18:54:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802948377] [2024-11-06 18:54:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802948377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:30,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853930060] [2024-11-06 18:54:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:30,770 INFO L87 Difference]: Start difference. First operand 1445 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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) [2024-11-06 18:54:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:31,402 INFO L93 Difference]: Finished difference Result 3281 states and 3722 transitions. [2024-11-06 18:54:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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 178 [2024-11-06 18:54:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:31,409 INFO L225 Difference]: With dead ends: 3281 [2024-11-06 18:54:31,409 INFO L226 Difference]: Without dead ends: 1838 [2024-11-06 18:54:31,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:31,412 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:31,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 26 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-06 18:54:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2024-11-06 18:54:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1301587301587301) internal successors, (1780), 1575 states have internal predecessors, (1780), 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) [2024-11-06 18:54:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1780 transitions. [2024-11-06 18:54:31,469 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1780 transitions. Word has length 178 [2024-11-06 18:54:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1780 transitions. [2024-11-06 18:54:31,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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) [2024-11-06 18:54:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1780 transitions. [2024-11-06 18:54:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 18:54:31,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:31,475 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 18:54:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:54:31,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:31,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1370986429, now seen corresponding path program 1 times [2024-11-06 18:54:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427207593] [2024-11-06 18:54:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-06 18:54:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427207593] [2024-11-06 18:54:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427207593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575035966] [2024-11-06 18:54:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:31,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:31,718 INFO L87 Difference]: Start difference. First operand 1576 states and 1780 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-06 18:54:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:32,338 INFO L93 Difference]: Finished difference Result 3412 states and 3908 transitions. [2024-11-06 18:54:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 203 [2024-11-06 18:54:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:32,345 INFO L225 Difference]: With dead ends: 3412 [2024-11-06 18:54:32,345 INFO L226 Difference]: Without dead ends: 1838 [2024-11-06 18:54:32,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:32,348 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 251 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:32,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 47 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-06 18:54:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2024-11-06 18:54:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1295590636908002) internal successors, (2075), 1837 states have internal predecessors, (2075), 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) [2024-11-06 18:54:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2075 transitions. [2024-11-06 18:54:32,389 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2075 transitions. Word has length 203 [2024-11-06 18:54:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:32,390 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2075 transitions. [2024-11-06 18:54:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-06 18:54:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2075 transitions. [2024-11-06 18:54:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-06 18:54:32,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:32,395 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 18:54:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:54:32,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:32,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash -351141726, now seen corresponding path program 1 times [2024-11-06 18:54:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550217923] [2024-11-06 18:54:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-06 18:54:32,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550217923] [2024-11-06 18:54:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550217923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:32,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810942464] [2024-11-06 18:54:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:32,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:32,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:32,583 INFO L87 Difference]: Start difference. First operand 1838 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2024-11-06 18:54:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:32,987 INFO L93 Difference]: Finished difference Result 3936 states and 4421 transitions. [2024-11-06 18:54:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 246 [2024-11-06 18:54:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:32,998 INFO L225 Difference]: With dead ends: 3936 [2024-11-06 18:54:32,998 INFO L226 Difference]: Without dead ends: 2100 [2024-11-06 18:54:33,001 INFO L431 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 [2024-11-06 18:54:33,001 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:33,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-06 18:54:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2024-11-06 18:54:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1046747967479675) internal successors, (2174), 1968 states have internal predecessors, (2174), 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) [2024-11-06 18:54:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2174 transitions. [2024-11-06 18:54:33,048 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2174 transitions. Word has length 246 [2024-11-06 18:54:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:33,049 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2174 transitions. [2024-11-06 18:54:33,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2024-11-06 18:54:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2174 transitions. [2024-11-06 18:54:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 18:54:33,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:33,055 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 18:54:33,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:54:33,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:33,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1730330183, now seen corresponding path program 1 times [2024-11-06 18:54:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056190005] [2024-11-06 18:54:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-06 18:54:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056190005] [2024-11-06 18:54:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056190005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:54:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538151971] [2024-11-06 18:54:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:33,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:54:33,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:54:33,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:54:33,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 18:54:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:33,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:54:33,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:54:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 18:54:33,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:54:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538151971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:54:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 18:54:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156782043] [2024-11-06 18:54:33,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:33,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:33,764 INFO L87 Difference]: Start difference. First operand 1969 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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) [2024-11-06 18:54:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:34,142 INFO L93 Difference]: Finished difference Result 3934 states and 4345 transitions. [2024-11-06 18:54:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 268 [2024-11-06 18:54:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:34,143 INFO L225 Difference]: With dead ends: 3934 [2024-11-06 18:54:34,143 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:54:34,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:34,147 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:34,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:54:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:54:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2024-11-06 18:54:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:54:34,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2024-11-06 18:54:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:54:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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) [2024-11-06 18:54:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:54:34,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:54:34,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:54:34,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 18:54:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 18:54:34,360 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:34,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:54:34,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:54:34,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:54:34 BoogieIcfgContainer [2024-11-06 18:54:34,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:54:34,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:54:34,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:54:34,544 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:54:34,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:24" (3/4) ... [2024-11-06 18:54:34,547 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:54:34,565 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:54:34,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:54:34,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:54:34,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:54:34,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:54:34,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:54:34,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:54:34,697 INFO L158 Benchmark]: Toolchain (without parser) took 12558.99ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 75.1MB in the beginning and 122.5MB in the end (delta: -47.3MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,697 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:34,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.58ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 48.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.23ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 42.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,698 INFO L158 Benchmark]: Boogie Preprocessor took 119.95ms. Allocated memory is still 100.7MB. Free memory was 42.8MB in the beginning and 72.4MB in the end (delta: -29.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,698 INFO L158 Benchmark]: RCFGBuilder took 1256.28ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 64.4MB in the end (delta: 8.0MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,698 INFO L158 Benchmark]: TraceAbstraction took 10511.92ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 63.9MB in the beginning and 133.3MB in the end (delta: -69.4MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,698 INFO L158 Benchmark]: Witness Printer took 152.19ms. Allocated memory is still 251.7MB. Free memory was 133.3MB in the beginning and 122.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:34,701 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.58ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 48.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.23ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 42.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.95ms. Allocated memory is still 100.7MB. Free memory was 42.8MB in the beginning and 72.4MB in the end (delta: -29.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1256.28ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 64.4MB in the end (delta: 8.0MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10511.92ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 63.9MB in the beginning and 133.3MB in the end (delta: -69.4MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * Witness Printer took 152.19ms. Allocated memory is still 251.7MB. Free memory was 133.3MB in the beginning and 122.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 537]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1824 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1824 mSDsluCounter, 732 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4970 IncrementalHoareTripleChecker+Invalid, 5851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 881 mSolverCounterUnsat, 634 mSDtfsCounter, 4970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1985 NumberOfCodeBlocks, 1985 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1974 ConstructedInterpolants, 0 QuantifiedInterpolants, 7401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1217/1309 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) || (((a21 == 1) && (a16 <= 5)) && (a20 == 1))) || ((a21 == 1) && (a16 <= 4))) || (a21 <= 0)) || ((a21 == 1) && (a8 != 13))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:54:34,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE