./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label02.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/Problem03_label02.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '940f009ebef4e6f688860c69fe317a06471b0d96e24220f1e9007ff15bc7124f'] 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/Problem03_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 940f009ebef4e6f688860c69fe317a06471b0d96e24220f1e9007ff15bc7124f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:35,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:35,179 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:55:35,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:35,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:35,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:35,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:35,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:35,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:35,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:35,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:35,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:35,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:35,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:35,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:35,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:35,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:35,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:35,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:35,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:35,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:35,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:35,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:35,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:35,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:35,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:35,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:35,213 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 -> 940f009ebef4e6f688860c69fe317a06471b0d96e24220f1e9007ff15bc7124f [2024-11-06 18:55:35,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:35,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:35,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:35,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:35,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:35,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2024-11-06 18:55:36,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:36,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:36,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2024-11-06 18:55:36,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552896140/542fccd3402e410e80c75d9167e122da/FLAGc0e98ba50 [2024-11-06 18:55:37,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552896140/542fccd3402e410e80c75d9167e122da [2024-11-06 18:55:37,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:37,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:37,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:37,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:37,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:37,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420386ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37, skipping insertion in model container [2024-11-06 18:55:37,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:37,433 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/Problem03_label02.c[61770,61783] [2024-11-06 18:55:37,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:37,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:37,590 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/Problem03_label02.c[61770,61783] [2024-11-06 18:55:37,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:37,613 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:37,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37 WrapperNode [2024-11-06 18:55:37,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:37,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:37,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:37,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:37,620 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:55:37" (1/1) ... [2024-11-06 18:55:37,642 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:55:37" (1/1) ... [2024-11-06 18:55:37,710 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-06 18:55:37,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:37,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:37,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:37,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:37,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,762 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:55:37,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:37,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:37,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:37,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:37,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (1/1) ... [2024-11-06 18:55:37,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:37,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:37,882 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:55:37,884 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:55:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:37,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:37,962 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:37,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:39,276 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:39,276 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:39,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:39,297 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:39,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:39 BoogieIcfgContainer [2024-11-06 18:55:39,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:39,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:39,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:39,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:39,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:37" (1/3) ... [2024-11-06 18:55:39,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc91467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:39, skipping insertion in model container [2024-11-06 18:55:39,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:37" (2/3) ... [2024-11-06 18:55:39,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc91467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:39, skipping insertion in model container [2024-11-06 18:55:39,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:39" (3/3) ... [2024-11-06 18:55:39,304 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2024-11-06 18:55:39,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:39,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:39,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:39,370 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;@3240816b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:39,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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:55:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-06 18:55:39,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:39,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:39,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -635106638, now seen corresponding path program 1 times [2024-11-06 18:55:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104593076] [2024-11-06 18:55:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:40,103 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:55:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104593076] [2024-11-06 18:55:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104593076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:40,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471787555] [2024-11-06 18:55:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:40,130 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 3 states, 3 states have (on average 68.0) internal successors, (204), 2 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:55:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:40,986 INFO L93 Difference]: Finished difference Result 855 states and 1496 transitions. [2024-11-06 18:55:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 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 204 [2024-11-06 18:55:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:40,998 INFO L225 Difference]: With dead ends: 855 [2024-11-06 18:55:40,999 INFO L226 Difference]: Without dead ends: 460 [2024-11-06 18:55:41,004 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:55:41,006 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:41,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 176 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:55:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-06 18:55:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2024-11-06 18:55:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 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:55:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2024-11-06 18:55:41,046 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 204 [2024-11-06 18:55:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2024-11-06 18:55:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 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:55:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2024-11-06 18:55:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-06 18:55:41,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:41,051 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:41,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash 237984642, now seen corresponding path program 1 times [2024-11-06 18:55:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834572844] [2024-11-06 18:55:41,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:41,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834572844] [2024-11-06 18:55:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834572844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604069220] [2024-11-06 18:55:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:41,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:41,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:41,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:41,291 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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:55:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:41,923 INFO L93 Difference]: Finished difference Result 1340 states and 2081 transitions. [2024-11-06 18:55:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 209 [2024-11-06 18:55:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:41,926 INFO L225 Difference]: With dead ends: 1340 [2024-11-06 18:55:41,927 INFO L226 Difference]: Without dead ends: 883 [2024-11-06 18:55:41,928 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:55:41,928 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:41,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 180 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-06 18:55:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2024-11-06 18:55:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4675767918088738) internal successors, (1290), 879 states have internal predecessors, (1290), 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:55:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1290 transitions. [2024-11-06 18:55:41,958 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1290 transitions. Word has length 209 [2024-11-06 18:55:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1290 transitions. [2024-11-06 18:55:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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:55:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1290 transitions. [2024-11-06 18:55:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-06 18:55:41,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:41,962 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:41,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash 317780433, now seen corresponding path program 1 times [2024-11-06 18:55:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589960283] [2024-11-06 18:55:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589960283] [2024-11-06 18:55:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589960283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:42,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568698716] [2024-11-06 18:55:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:42,129 INFO L87 Difference]: Start difference. First operand 880 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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:55:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:42,707 INFO L93 Difference]: Finished difference Result 2594 states and 3819 transitions. [2024-11-06 18:55:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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 212 [2024-11-06 18:55:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:42,715 INFO L225 Difference]: With dead ends: 2594 [2024-11-06 18:55:42,715 INFO L226 Difference]: Without dead ends: 1716 [2024-11-06 18:55:42,716 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:55:42,719 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:42,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-06 18:55:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1696. [2024-11-06 18:55:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 1.4377581120943952) internal successors, (2437), 1695 states have internal predecessors, (2437), 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:55:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2437 transitions. [2024-11-06 18:55:42,747 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2437 transitions. Word has length 212 [2024-11-06 18:55:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2437 transitions. [2024-11-06 18:55:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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:55:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2437 transitions. [2024-11-06 18:55:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-06 18:55:42,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:42,750 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:42,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -73934984, now seen corresponding path program 1 times [2024-11-06 18:55:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480747064] [2024-11-06 18:55:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480747064] [2024-11-06 18:55:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480747064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:42,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:42,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188964518] [2024-11-06 18:55:42,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:42,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:42,985 INFO L87 Difference]: Start difference. First operand 1696 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:55:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:43,651 INFO L93 Difference]: Finished difference Result 5017 states and 7218 transitions. [2024-11-06 18:55:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 224 [2024-11-06 18:55:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:43,660 INFO L225 Difference]: With dead ends: 5017 [2024-11-06 18:55:43,660 INFO L226 Difference]: Without dead ends: 3323 [2024-11-06 18:55:43,662 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:55:43,664 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 235 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:43,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 411 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2024-11-06 18:55:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3320. [2024-11-06 18:55:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.2847243145525762) internal successors, (4264), 3319 states have internal predecessors, (4264), 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:55:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4264 transitions. [2024-11-06 18:55:43,712 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4264 transitions. Word has length 224 [2024-11-06 18:55:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:43,712 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4264 transitions. [2024-11-06 18:55:43,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:55:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4264 transitions. [2024-11-06 18:55:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-06 18:55:43,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:43,718 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:43,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1912274208, now seen corresponding path program 1 times [2024-11-06 18:55:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559033177] [2024-11-06 18:55:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:43,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:43,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559033177] [2024-11-06 18:55:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559033177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:43,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875260544] [2024-11-06 18:55:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:43,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:43,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:43,978 INFO L87 Difference]: Start difference. First operand 3320 states and 4264 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:55:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:44,663 INFO L93 Difference]: Finished difference Result 9900 states and 12717 transitions. [2024-11-06 18:55:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 239 [2024-11-06 18:55:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:44,683 INFO L225 Difference]: With dead ends: 9900 [2024-11-06 18:55:44,683 INFO L226 Difference]: Without dead ends: 6582 [2024-11-06 18:55:44,688 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:55:44,690 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:44,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 418 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2024-11-06 18:55:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6577. [2024-11-06 18:55:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 1.2244525547445255) internal successors, (8052), 6576 states have internal predecessors, (8052), 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:55:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8052 transitions. [2024-11-06 18:55:44,817 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8052 transitions. Word has length 239 [2024-11-06 18:55:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 6577 states and 8052 transitions. [2024-11-06 18:55:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:55:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8052 transitions. [2024-11-06 18:55:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-06 18:55:44,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:44,827 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:44,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -177417023, now seen corresponding path program 1 times [2024-11-06 18:55:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668933694] [2024-11-06 18:55:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668933694] [2024-11-06 18:55:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668933694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968121188] [2024-11-06 18:55:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:45,124 INFO L87 Difference]: Start difference. First operand 6577 states and 8052 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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:55:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:45,815 INFO L93 Difference]: Finished difference Result 16215 states and 19822 transitions. [2024-11-06 18:55:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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 245 [2024-11-06 18:55:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:45,843 INFO L225 Difference]: With dead ends: 16215 [2024-11-06 18:55:45,844 INFO L226 Difference]: Without dead ends: 9640 [2024-11-06 18:55:45,852 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:55:45,853 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:45,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2024-11-06 18:55:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9638. [2024-11-06 18:55:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.2036940956729272) internal successors, (11600), 9637 states have internal predecessors, (11600), 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:55:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11600 transitions. [2024-11-06 18:55:46,002 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11600 transitions. Word has length 245 [2024-11-06 18:55:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:46,003 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11600 transitions. [2024-11-06 18:55:46,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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:55:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11600 transitions. [2024-11-06 18:55:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-06 18:55:46,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:46,016 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:46,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:46,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -285299978, now seen corresponding path program 1 times [2024-11-06 18:55:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888102605] [2024-11-06 18:55:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888102605] [2024-11-06 18:55:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888102605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:55:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355867688] [2024-11-06 18:55:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:46,345 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:55:46,347 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:55:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:46,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:55:46,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:55:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:46,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:55:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355867688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:55:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:55:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689212202] [2024-11-06 18:55:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:46,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:46,718 INFO L87 Difference]: Start difference. First operand 9638 states and 11600 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:55:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:47,314 INFO L93 Difference]: Finished difference Result 19277 states and 23203 transitions. [2024-11-06 18:55:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 252 [2024-11-06 18:55:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:47,338 INFO L225 Difference]: With dead ends: 19277 [2024-11-06 18:55:47,338 INFO L226 Difference]: Without dead ends: 9641 [2024-11-06 18:55:47,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:47,349 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 74 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:47,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 98 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9641 states. [2024-11-06 18:55:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9641 to 9638. [2024-11-06 18:55:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.1976756251945626) internal successors, (11542), 9637 states have internal predecessors, (11542), 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:55:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11542 transitions. [2024-11-06 18:55:47,472 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11542 transitions. Word has length 252 [2024-11-06 18:55:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11542 transitions. [2024-11-06 18:55:47,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:55:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11542 transitions. [2024-11-06 18:55:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-06 18:55:47,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:47,487 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 18:55:47,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:47,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1904547740, now seen corresponding path program 1 times [2024-11-06 18:55:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076267232] [2024-11-06 18:55:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-06 18:55:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076267232] [2024-11-06 18:55:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076267232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:55:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187053405] [2024-11-06 18:55:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:48,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:48,104 INFO L229 MonitoredProcess]: Starting monitored process 3 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:55:48,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 18:55:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:48,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:55:48,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:55:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:48,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:55:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187053405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:55:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:55:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078592236] [2024-11-06 18:55:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:48,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:48,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:48,354 INFO L87 Difference]: Start difference. First operand 9638 states and 11542 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:55:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:48,917 INFO L93 Difference]: Finished difference Result 23134 states and 28186 transitions. [2024-11-06 18:55:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 313 [2024-11-06 18:55:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:48,939 INFO L225 Difference]: With dead ends: 23134 [2024-11-06 18:55:48,939 INFO L226 Difference]: Without dead ends: 13498 [2024-11-06 18:55:48,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:48,949 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 186 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:48,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 166 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2024-11-06 18:55:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 13495. [2024-11-06 18:55:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13495 states, 13494 states have (on average 1.1723729064769528) internal successors, (15820), 13494 states have internal predecessors, (15820), 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:55:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13495 states to 13495 states and 15820 transitions. [2024-11-06 18:55:49,074 INFO L78 Accepts]: Start accepts. Automaton has 13495 states and 15820 transitions. Word has length 313 [2024-11-06 18:55:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:49,074 INFO L471 AbstractCegarLoop]: Abstraction has 13495 states and 15820 transitions. [2024-11-06 18:55:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:55:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13495 states and 15820 transitions. [2024-11-06 18:55:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-06 18:55:49,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:49,094 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 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:55:49,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 18:55:49,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:49,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:49,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1147355766, now seen corresponding path program 1 times [2024-11-06 18:55:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004061226] [2024-11-06 18:55:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-06 18:55:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004061226] [2024-11-06 18:55:49,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004061226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:55:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329357018] [2024-11-06 18:55:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:49,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:49,622 INFO L229 MonitoredProcess]: Starting monitored process 4 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:55:49,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 18:55:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:49,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:55:49,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:55:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:49,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:55:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329357018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:55:49,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:55:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-11-06 18:55:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757602850] [2024-11-06 18:55:49,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:55:49,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:55:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:55:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:55:49,956 INFO L87 Difference]: Start difference. First operand 13495 states and 15820 transitions. Second operand has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 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:55:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:53,347 INFO L93 Difference]: Finished difference Result 63934 states and 75431 transitions. [2024-11-06 18:55:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 18:55:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 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 329 [2024-11-06 18:55:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:53,421 INFO L225 Difference]: With dead ends: 63934 [2024-11-06 18:55:53,421 INFO L226 Difference]: Without dead ends: 50440 [2024-11-06 18:55:53,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:55:53,431 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2919 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 4777 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2919 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 5680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 4777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:53,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2919 Valid, 469 Invalid, 5680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 4777 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 18:55:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50440 states. [2024-11-06 18:55:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50440 to 50198. [2024-11-06 18:55:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50198 states, 50197 states have (on average 1.1181345498734985) internal successors, (56127), 50197 states have internal predecessors, (56127), 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:55:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50198 states to 50198 states and 56127 transitions. [2024-11-06 18:55:53,855 INFO L78 Accepts]: Start accepts. Automaton has 50198 states and 56127 transitions. Word has length 329 [2024-11-06 18:55:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 50198 states and 56127 transitions. [2024-11-06 18:55:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 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:55:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 50198 states and 56127 transitions. [2024-11-06 18:55:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-06 18:55:54,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:54,041 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2024-11-06 18:55:54,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 18:55:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:54,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1219516023, now seen corresponding path program 1 times [2024-11-06 18:55:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326332615] [2024-11-06 18:55:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 18:55:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326332615] [2024-11-06 18:55:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326332615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877599697] [2024-11-06 18:55:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:54,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:54,492 INFO L87 Difference]: Start difference. First operand 50198 states and 56127 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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:55:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:55,167 INFO L93 Difference]: Finished difference Result 119303 states and 133693 transitions. [2024-11-06 18:55:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 397 [2024-11-06 18:55:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:55,248 INFO L225 Difference]: With dead ends: 119303 [2024-11-06 18:55:55,249 INFO L226 Difference]: Without dead ends: 69107 [2024-11-06 18:55:55,288 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:55:55,288 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:55,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 198 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69107 states. [2024-11-06 18:55:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69107 to 63819. [2024-11-06 18:55:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63819 states, 63818 states have (on average 1.1158450593876337) internal successors, (71211), 63818 states have internal predecessors, (71211), 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:55:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63819 states to 63819 states and 71211 transitions. [2024-11-06 18:55:56,039 INFO L78 Accepts]: Start accepts. Automaton has 63819 states and 71211 transitions. Word has length 397 [2024-11-06 18:55:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 63819 states and 71211 transitions. [2024-11-06 18:55:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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:55:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63819 states and 71211 transitions. [2024-11-06 18:55:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-06 18:55:56,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:56,104 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:56,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:55:56,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:56,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 278214634, now seen corresponding path program 1 times [2024-11-06 18:55:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068243384] [2024-11-06 18:55:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-06 18:55:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:56,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068243384] [2024-11-06 18:55:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068243384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151373258] [2024-11-06 18:55:56,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:56,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:56,393 INFO L87 Difference]: Start difference. First operand 63819 states and 71211 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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:55:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:57,312 INFO L93 Difference]: Finished difference Result 185461 states and 206981 transitions. [2024-11-06 18:55:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:57,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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 402 [2024-11-06 18:55:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:57,457 INFO L225 Difference]: With dead ends: 185461 [2024-11-06 18:55:57,458 INFO L226 Difference]: Without dead ends: 121644 [2024-11-06 18:55:57,507 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:55:57,508 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 793 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:57,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 390 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121644 states. [2024-11-06 18:55:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121644 to 121216. [2024-11-06 18:55:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121216 states, 121215 states have (on average 1.1154395083116777) internal successors, (135208), 121215 states have internal predecessors, (135208), 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:55:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121216 states to 121216 states and 135208 transitions. [2024-11-06 18:55:58,875 INFO L78 Accepts]: Start accepts. Automaton has 121216 states and 135208 transitions. Word has length 402 [2024-11-06 18:55:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 121216 states and 135208 transitions. [2024-11-06 18:55:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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:55:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 121216 states and 135208 transitions. [2024-11-06 18:55:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-06 18:55:58,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:58,967 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:58,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:55:58,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2139265070, now seen corresponding path program 1 times [2024-11-06 18:55:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936484199] [2024-11-06 18:55:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 121 proven. 6 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-06 18:55:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936484199] [2024-11-06 18:55:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936484199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:55:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290409519] [2024-11-06 18:55:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:59,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:59,465 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:59,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 18:55:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:59,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:55:59,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:55:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-06 18:55:59,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:55:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290409519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:55:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:55:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264869529] [2024-11-06 18:55:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:59,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:59,711 INFO L87 Difference]: Start difference. First operand 121216 states and 135208 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:56:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:56:00,336 INFO L93 Difference]: Finished difference Result 228616 states and 255119 transitions. [2024-11-06 18:56:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:56:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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 406 [2024-11-06 18:56:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:56:00,462 INFO L225 Difference]: With dead ends: 228616 [2024-11-06 18:56:00,463 INFO L226 Difference]: Without dead ends: 107402 [2024-11-06 18:56:00,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:56:00,540 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 303 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:56:00,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 928 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:56:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2024-11-06 18:56:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 106587. [2024-11-06 18:56:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106587 states, 106586 states have (on average 1.1042256956823597) internal successors, (117695), 106586 states have internal predecessors, (117695), 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:56:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106587 states to 106587 states and 117695 transitions. [2024-11-06 18:56:01,985 INFO L78 Accepts]: Start accepts. Automaton has 106587 states and 117695 transitions. Word has length 406 [2024-11-06 18:56:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:56:01,985 INFO L471 AbstractCegarLoop]: Abstraction has 106587 states and 117695 transitions. [2024-11-06 18:56:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:56:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 106587 states and 117695 transitions. [2024-11-06 18:56:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-06 18:56:02,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:56:02,039 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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] [2024-11-06 18:56:02,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 18:56:02,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 18:56:02,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:56:02,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:56:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -321916057, now seen corresponding path program 1 times [2024-11-06 18:56:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:56:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752615317] [2024-11-06 18:56:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:56:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:56:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:56:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 128 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-06 18:56:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:56:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752615317] [2024-11-06 18:56:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752615317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:56:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774637903] [2024-11-06 18:56:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:56:02,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:56:02,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:56:02,794 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:02,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 18:56:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:56:02,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:56:02,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:56:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-06 18:56:03,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:56:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774637903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:56:03,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:56:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:56:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000817019] [2024-11-06 18:56:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:56:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:56:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:56:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:56:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:56:03,149 INFO L87 Difference]: Start difference. First operand 106587 states and 117695 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:56:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:56:04,077 INFO L93 Difference]: Finished difference Result 244558 states and 271220 transitions. [2024-11-06 18:56:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:56:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 406 [2024-11-06 18:56:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:56:04,079 INFO L225 Difference]: With dead ends: 244558 [2024-11-06 18:56:04,079 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:56:04,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:56:04,154 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 67 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:56:04,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 152 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:56:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:56:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:56:04,155 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:56:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:56:04,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 406 [2024-11-06 18:56:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:56:04,156 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:56:04,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:56:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:56:04,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:56:04,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:56:04,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 18:56:04,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 18:56:04,361 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:56:04,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:56:15,736 WARN L286 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 789 DAG size of output: 743 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-06 18:56:23,278 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 743 DAG size of output: 62 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-06 18:56:23,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:56:23,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:56:23 BoogieIcfgContainer [2024-11-06 18:56:23,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:56:23,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:56:23,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:56:23,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:56:23,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:39" (3/4) ... [2024-11-06 18:56:23,306 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:56:23,329 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:56:23,331 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:56:23,332 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:56:23,333 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:56:23,454 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:56:23,454 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:56:23,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:56:23,455 INFO L158 Benchmark]: Toolchain (without parser) took 46347.55ms. Allocated memory was 109.1MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 79.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2024-11-06 18:56:23,455 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:56:23,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.47ms. Allocated memory is still 109.1MB. Free memory was 79.4MB in the beginning and 63.9MB in the end (delta: 15.5MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-11-06 18:56:23,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.30ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 49.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:56:23,455 INFO L158 Benchmark]: Boogie Preprocessor took 117.54ms. Allocated memory is still 109.1MB. Free memory was 49.3MB in the beginning and 37.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:56:23,456 INFO L158 Benchmark]: RCFGBuilder took 1468.13ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 37.7MB in the beginning and 44.8MB in the end (delta: -7.1MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-06 18:56:23,456 INFO L158 Benchmark]: TraceAbstraction took 44002.64ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 43.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-06 18:56:23,456 INFO L158 Benchmark]: Witness Printer took 153.01ms. Allocated memory is still 5.7GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:56:23,457 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.47ms. Allocated memory is still 109.1MB. Free memory was 79.4MB in the beginning and 63.9MB in the end (delta: 15.5MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.30ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 49.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.54ms. Allocated memory is still 109.1MB. Free memory was 49.3MB in the beginning and 37.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1468.13ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 37.7MB in the beginning and 44.8MB in the end (delta: -7.1MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44002.64ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 43.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 153.01ms. Allocated memory is still 5.7GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. 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: 1657]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5726 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5726 mSDsluCounter, 3833 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1131 mSDsCounter, 2328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11722 IncrementalHoareTripleChecker+Invalid, 14050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2328 mSolverCounterUnsat, 2702 mSDtfsCounter, 11722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2086 GetRequests, 2050 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121216occurred in iteration=11, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 6813 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5544 NumberOfCodeBlocks, 5544 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5854 ConstructedInterpolants, 0 QuantifiedInterpolants, 10226 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2979 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 2997/3053 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a26 == 1) && (a12 == 1)) && (a29 <= 0)) && (a11 == 1)) && (a3 == 0)) || (((a11 == 1) && (a3 == 1)) && (a29 == 1))) || (((((1 <= a3) && (a27 != 1)) && (a16 == 1)) && (a11 == 1)) && (a29 == 1))) || ((((a11 <= 0) && (a29 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((a26 != 1) && (a29 <= 0)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((1 <= a3) && (a11 == 1)) && (a29 == 1)) && (a12 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a29 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((a26 == 1) && (a12 == 1)) && (a11 == 1)) && (a29 == 1)) && (a3 == 0))) || (((((a5 == 1) && (1 <= a3)) && (a11 == 1)) && (a29 == 1)) && (a27 == 1))) || ((((a29 <= 0) && (a7 != 1)) && (a11 <= 0)) && (a3 == 0))) || (((1 <= a3) && (a29 <= 0)) && (a11 == 1))) || (((((a26 == 1) && (a12 == 1)) && (a11 <= 0)) && (a29 == 1)) && (a3 == 0))) || ((a29 <= 0) && (((((a26 != 1) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0)) || (((((a26 != 1) && (a6 != 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))))) || (((((1 <= a3) && (a11 == 1)) && (a29 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((a29 <= 0) && (a11 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((a7 != 1) && (a11 <= 0)) && (a29 == 1)) && (a3 == 0))) || ((((a29 <= 0) && (a11 == 1)) && (a12 <= 0)) && (a3 == 0))) || ((a29 == 1) && (((((a26 != 1) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0)) || (((((a26 != 1) && (a6 != 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))))) || (((((((a5 == 1) && (a29 <= 0)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((1 <= a3) && (a29 <= 0)) && (a11 <= 0))) || (((((((a26 == 1) && (a12 == 1)) && (a27 != 1)) && (a29 <= 0)) && (a16 == 1)) && (a11 <= 0)) && (a3 == 0))) || ((((a11 == 1) && (a29 == 1)) && (a12 <= 0)) && (a3 == 0))) || ((((((a26 == 1) && (a12 == 1)) && (1 <= a3)) && (a11 == 1)) && (a29 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a12 == 1)) && (1 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a29 == 1)) && (a27 == 1))) || (((1 <= a3) && (a11 <= 0)) && (a29 == 1))) || ((((a11 == 1) && (a29 == 1)) && (a27 == 1)) && (a3 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:56:23,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE