./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label21.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/Problem14_label21.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', 'd844f5f056e0756d76cce620ddef5d81b013b68e741e848d9617fc0c9c828b8e'] 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/Problem14_label21.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 d844f5f056e0756d76cce620ddef5d81b013b68e741e848d9617fc0c9c828b8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:53:07,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:53:07,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:53:07,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:53:07,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:53:07,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:53:07,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:53:07,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:53:07,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:53:07,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:53:07,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:53:07,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:53:07,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:53:07,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:53:07,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:53:07,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:53:07,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:53:07,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:53:07,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:53:07,564 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 -> d844f5f056e0756d76cce620ddef5d81b013b68e741e848d9617fc0c9c828b8e [2024-11-06 19:53:07,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:53:07,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:53:07,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:53:07,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:53:07,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:53:07,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label21.c [2024-11-06 19:53:08,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:53:09,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:53:09,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label21.c [2024-11-06 19:53:09,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9ae08bb/fb35a713e3224776b33e0fab4d4eaf4d/FLAG05eedfbcf [2024-11-06 19:53:09,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9ae08bb/fb35a713e3224776b33e0fab4d4eaf4d [2024-11-06 19:53:09,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:53:09,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:53:09,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:53:09,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:53:09,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:53:09,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be0beb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09, skipping insertion in model container [2024-11-06 19:53:09,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:53:09,587 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/Problem14_label21.c[3617,3630] [2024-11-06 19:53:09,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:53:09,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:53:09,746 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/Problem14_label21.c[3617,3630] [2024-11-06 19:53:09,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:53:09,837 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:53:09,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09 WrapperNode [2024-11-06 19:53:09,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:53:09,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:53:09,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:53:09,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:53:09,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,903 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-06 19:53:09,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:53:09,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:53:09,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:53:09,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:53:09,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,960 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 19:53:09,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:09,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:10,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:10,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:53:10,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:53:10,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:53:10,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:53:10,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (1/1) ... [2024-11-06 19:53:10,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:53:10,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:53:10,045 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 19:53:10,049 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 19:53:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:53:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:53:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:53:10,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:53:10,110 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:53:10,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:53:10,955 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-06 19:53:10,955 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:53:10,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:53:10,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:53:10,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:53:10 BoogieIcfgContainer [2024-11-06 19:53:10,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:53:10,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:53:10,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:53:10,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:53:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:53:09" (1/3) ... [2024-11-06 19:53:10,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfc0d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:53:10, skipping insertion in model container [2024-11-06 19:53:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:53:09" (2/3) ... [2024-11-06 19:53:10,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfc0d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:53:10, skipping insertion in model container [2024-11-06 19:53:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:53:10" (3/3) ... [2024-11-06 19:53:10,976 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label21.c [2024-11-06 19:53:10,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:53:10,986 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:53:11,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:53:11,034 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;@7d3b4c84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:53:11,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:53:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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 19:53:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 19:53:11,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:11,044 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] [2024-11-06 19:53:11,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2024-11-06 19:53:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144083064] [2024-11-06 19:53:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:11,269 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 19:53:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144083064] [2024-11-06 19:53:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144083064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:11,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:11,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:53:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63052355] [2024-11-06 19:53:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:11,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:11,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:11,294 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 19:53:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:11,974 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-06 19:53:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2024-11-06 19:53:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:11,985 INFO L225 Difference]: With dead ends: 669 [2024-11-06 19:53:11,985 INFO L226 Difference]: Without dead ends: 360 [2024-11-06 19:53:11,991 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 19:53:11,992 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:11,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:53:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-06 19:53:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-06 19:53:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 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 19:53:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2024-11-06 19:53:12,033 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 34 [2024-11-06 19:53:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:12,033 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2024-11-06 19:53:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 19:53:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2024-11-06 19:53:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 19:53:12,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:12,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:12,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:53:12,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1732143824, now seen corresponding path program 1 times [2024-11-06 19:53:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099400496] [2024-11-06 19:53:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:53:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099400496] [2024-11-06 19:53:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099400496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:53:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045107523] [2024-11-06 19:53:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:12,208 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 19:53:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:12,721 INFO L93 Difference]: Finished difference Result 1076 states and 1760 transitions. [2024-11-06 19:53:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:12,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2024-11-06 19:53:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:12,724 INFO L225 Difference]: With dead ends: 1076 [2024-11-06 19:53:12,724 INFO L226 Difference]: Without dead ends: 718 [2024-11-06 19:53:12,725 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 19:53:12,725 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:12,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:53:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-06 19:53:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2024-11-06 19:53:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4223776223776223) internal successors, (1017), 715 states have internal predecessors, (1017), 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 19:53:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2024-11-06 19:53:12,748 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 99 [2024-11-06 19:53:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2024-11-06 19:53:12,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 19:53:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2024-11-06 19:53:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 19:53:12,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:12,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:12,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:53:12,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:12,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 22069033, now seen corresponding path program 1 times [2024-11-06 19:53:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332808269] [2024-11-06 19:53:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:53:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332808269] [2024-11-06 19:53:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332808269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:53:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738912541] [2024-11-06 19:53:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:12,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:12,883 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 19:53:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:13,390 INFO L93 Difference]: Finished difference Result 1608 states and 2324 transitions. [2024-11-06 19:53:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:13,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2024-11-06 19:53:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:13,393 INFO L225 Difference]: With dead ends: 1608 [2024-11-06 19:53:13,393 INFO L226 Difference]: Without dead ends: 894 [2024-11-06 19:53:13,393 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 19:53:13,394 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:13,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:53:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-06 19:53:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-06 19:53:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3314669652855544) internal successors, (1189), 893 states have internal predecessors, (1189), 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 19:53:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1189 transitions. [2024-11-06 19:53:13,408 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1189 transitions. Word has length 100 [2024-11-06 19:53:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:13,409 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1189 transitions. [2024-11-06 19:53:13,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 19:53:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1189 transitions. [2024-11-06 19:53:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-06 19:53:13,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:13,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:13,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:53:13,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1642942022, now seen corresponding path program 1 times [2024-11-06 19:53:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488036534] [2024-11-06 19:53:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:53:13,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:13,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488036534] [2024-11-06 19:53:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488036534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:13,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:13,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165712014] [2024-11-06 19:53:13,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:13,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:53:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:53:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:53:13,655 INFO L87 Difference]: Start difference. First operand 894 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 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 19:53:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:14,366 INFO L93 Difference]: Finished difference Result 2144 states and 2782 transitions. [2024-11-06 19:53:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:53:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2024-11-06 19:53:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:14,370 INFO L225 Difference]: With dead ends: 2144 [2024-11-06 19:53:14,370 INFO L226 Difference]: Without dead ends: 1252 [2024-11-06 19:53:14,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:14,372 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:14,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:53:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-06 19:53:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2024-11-06 19:53:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.257005604483587) internal successors, (1570), 1249 states have internal predecessors, (1570), 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 19:53:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1570 transitions. [2024-11-06 19:53:14,401 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1570 transitions. Word has length 103 [2024-11-06 19:53:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:14,402 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1570 transitions. [2024-11-06 19:53:14,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 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 19:53:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1570 transitions. [2024-11-06 19:53:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 19:53:14,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:14,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:14,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:53:14,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1896681766, now seen corresponding path program 1 times [2024-11-06 19:53:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065511105] [2024-11-06 19:53:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:53:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065511105] [2024-11-06 19:53:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065511105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461296023] [2024-11-06 19:53:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:53:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:53:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:53:14,605 INFO L87 Difference]: Start difference. First operand 1250 states and 1570 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:53:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:15,169 INFO L93 Difference]: Finished difference Result 2885 states and 3573 transitions. [2024-11-06 19:53:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:53:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-06 19:53:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:15,174 INFO L225 Difference]: With dead ends: 2885 [2024-11-06 19:53:15,174 INFO L226 Difference]: Without dead ends: 1608 [2024-11-06 19:53:15,175 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 19:53:15,176 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:15,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 123 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:53:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-06 19:53:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2024-11-06 19:53:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1314641744548286) internal successors, (1816), 1605 states have internal predecessors, (1816), 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 19:53:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1816 transitions. [2024-11-06 19:53:15,201 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1816 transitions. Word has length 114 [2024-11-06 19:53:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:15,201 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1816 transitions. [2024-11-06 19:53:15,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:53:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1816 transitions. [2024-11-06 19:53:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-06 19:53:15,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:15,203 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:53:15,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash 535573908, now seen corresponding path program 1 times [2024-11-06 19:53:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187989734] [2024-11-06 19:53:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:53:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187989734] [2024-11-06 19:53:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187989734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187157476] [2024-11-06 19:53:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:15,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:15,453 INFO L87 Difference]: Start difference. First operand 1606 states and 1816 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 19:53:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:15,873 INFO L93 Difference]: Finished difference Result 3922 states and 4494 transitions. [2024-11-06 19:53:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2024-11-06 19:53:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:15,879 INFO L225 Difference]: With dead ends: 3922 [2024-11-06 19:53:15,879 INFO L226 Difference]: Without dead ends: 2318 [2024-11-06 19:53:15,881 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 19:53:15,881 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:15,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-06 19:53:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2024-11-06 19:53:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1173445535296869) internal successors, (2390), 2139 states have internal predecessors, (2390), 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 19:53:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2390 transitions. [2024-11-06 19:53:15,910 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2390 transitions. Word has length 208 [2024-11-06 19:53:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:15,911 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2390 transitions. [2024-11-06 19:53:15,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 19:53:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2390 transitions. [2024-11-06 19:53:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-06 19:53:15,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:15,913 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 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] [2024-11-06 19:53:15,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:53:15,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:15,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1934153555, now seen corresponding path program 1 times [2024-11-06 19:53:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005833706] [2024-11-06 19:53:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-06 19:53:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005833706] [2024-11-06 19:53:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005833706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:16,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516275416] [2024-11-06 19:53:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:53:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:53:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:53:16,167 INFO L87 Difference]: Start difference. First operand 2140 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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 19:53:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:16,652 INFO L93 Difference]: Finished difference Result 4336 states and 4860 transitions. [2024-11-06 19:53:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:53:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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 325 [2024-11-06 19:53:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:16,658 INFO L225 Difference]: With dead ends: 4336 [2024-11-06 19:53:16,658 INFO L226 Difference]: Without dead ends: 2318 [2024-11-06 19:53:16,660 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 19:53:16,661 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:16,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:53:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-06 19:53:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2024-11-06 19:53:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.077606358111267) internal successors, (2305), 2139 states have internal predecessors, (2305), 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 19:53:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2305 transitions. [2024-11-06 19:53:16,688 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2305 transitions. Word has length 325 [2024-11-06 19:53:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2305 transitions. [2024-11-06 19:53:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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 19:53:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2305 transitions. [2024-11-06 19:53:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-11-06 19:53:16,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:16,695 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:16,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:53:16,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:16,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash -240102924, now seen corresponding path program 1 times [2024-11-06 19:53:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:16,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718259340] [2024-11-06 19:53:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-06 19:53:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718259340] [2024-11-06 19:53:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718259340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957970957] [2024-11-06 19:53:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:17,094 INFO L87 Difference]: Start difference. First operand 2140 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 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 19:53:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:17,490 INFO L93 Difference]: Finished difference Result 4456 states and 4866 transitions. [2024-11-06 19:53:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 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 420 [2024-11-06 19:53:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:17,497 INFO L225 Difference]: With dead ends: 4456 [2024-11-06 19:53:17,497 INFO L226 Difference]: Without dead ends: 2496 [2024-11-06 19:53:17,499 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 19:53:17,499 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:17,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-06 19:53:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2024-11-06 19:53:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0775114737378888) internal successors, (2113), 1961 states have internal predecessors, (2113), 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 19:53:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2113 transitions. [2024-11-06 19:53:17,524 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2113 transitions. Word has length 420 [2024-11-06 19:53:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2113 transitions. [2024-11-06 19:53:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 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 19:53:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2113 transitions. [2024-11-06 19:53:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 19:53:17,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:17,530 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:53:17,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 313193583, now seen corresponding path program 1 times [2024-11-06 19:53:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521080981] [2024-11-06 19:53:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-06 19:53:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521080981] [2024-11-06 19:53:17,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521080981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:17,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:17,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21558984] [2024-11-06 19:53:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:17,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:17,841 INFO L87 Difference]: Start difference. First operand 1962 states and 2113 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 19:53:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:18,231 INFO L93 Difference]: Finished difference Result 4456 states and 4867 transitions. [2024-11-06 19:53:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:18,233 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 427 [2024-11-06 19:53:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:18,240 INFO L225 Difference]: With dead ends: 4456 [2024-11-06 19:53:18,240 INFO L226 Difference]: Without dead ends: 2674 [2024-11-06 19:53:18,242 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 19:53:18,243 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:18,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 203 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-06 19:53:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2024-11-06 19:53:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0837675350701403) internal successors, (2704), 2495 states have internal predecessors, (2704), 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 19:53:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2704 transitions. [2024-11-06 19:53:18,275 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2704 transitions. Word has length 427 [2024-11-06 19:53:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:18,275 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2704 transitions. [2024-11-06 19:53:18,276 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 19:53:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2704 transitions. [2024-11-06 19:53:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-06 19:53:18,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:18,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:53:18,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1953493490, now seen corresponding path program 1 times [2024-11-06 19:53:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672511264] [2024-11-06 19:53:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-06 19:53:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672511264] [2024-11-06 19:53:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672511264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984313274] [2024-11-06 19:53:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:18,503 INFO L87 Difference]: Start difference. First operand 2496 states and 2704 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 19:53:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:18,912 INFO L93 Difference]: Finished difference Result 5880 states and 6460 transitions. [2024-11-06 19:53:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 468 [2024-11-06 19:53:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:18,926 INFO L225 Difference]: With dead ends: 5880 [2024-11-06 19:53:18,926 INFO L226 Difference]: Without dead ends: 3564 [2024-11-06 19:53:18,928 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 19:53:18,929 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:18,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2024-11-06 19:53:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2024-11-06 19:53:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.079708111142296) internal successors, (3847), 3563 states have internal predecessors, (3847), 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 19:53:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3847 transitions. [2024-11-06 19:53:18,971 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3847 transitions. Word has length 468 [2024-11-06 19:53:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:18,972 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3847 transitions. [2024-11-06 19:53:18,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 19:53:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3847 transitions. [2024-11-06 19:53:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-06 19:53:18,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:18,974 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:53:18,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1407887867, now seen corresponding path program 1 times [2024-11-06 19:53:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049365702] [2024-11-06 19:53:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-06 19:53:19,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:19,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049365702] [2024-11-06 19:53:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049365702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:19,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298813611] [2024-11-06 19:53:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:19,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:19,223 INFO L87 Difference]: Start difference. First operand 3564 states and 3847 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 19:53:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:19,611 INFO L93 Difference]: Finished difference Result 7126 states and 7708 transitions. [2024-11-06 19:53:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 504 [2024-11-06 19:53:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:19,620 INFO L225 Difference]: With dead ends: 7126 [2024-11-06 19:53:19,620 INFO L226 Difference]: Without dead ends: 3742 [2024-11-06 19:53:19,623 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 19:53:19,624 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:19,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-06 19:53:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3208. [2024-11-06 19:53:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0757717492984098) internal successors, (3450), 3207 states have internal predecessors, (3450), 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 19:53:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3450 transitions. [2024-11-06 19:53:19,660 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3450 transitions. Word has length 504 [2024-11-06 19:53:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3450 transitions. [2024-11-06 19:53:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 19:53:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3450 transitions. [2024-11-06 19:53:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-11-06 19:53:19,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:19,665 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2024-11-06 19:53:19,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:53:19,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:19,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2137582567, now seen corresponding path program 1 times [2024-11-06 19:53:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656679053] [2024-11-06 19:53:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 802 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-06 19:53:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656679053] [2024-11-06 19:53:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656679053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:53:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73352275] [2024-11-06 19:53:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:19,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:19,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:53:19,928 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 19:53:19,930 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 19:53:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:20,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:53:20,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:53:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-11-06 19:53:20,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:53:20,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73352275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:53:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:53:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149291705] [2024-11-06 19:53:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:20,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:20,188 INFO L87 Difference]: Start difference. First operand 3208 states and 3450 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 19:53:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:20,570 INFO L93 Difference]: Finished difference Result 6948 states and 7489 transitions. [2024-11-06 19:53:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:20,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 623 [2024-11-06 19:53:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:20,578 INFO L225 Difference]: With dead ends: 6948 [2024-11-06 19:53:20,578 INFO L226 Difference]: Without dead ends: 3208 [2024-11-06 19:53:20,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:20,582 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 147 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:20,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:53:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-06 19:53:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2024-11-06 19:53:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0740091196071553) internal successors, (3062), 2851 states have internal predecessors, (3062), 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 19:53:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3062 transitions. [2024-11-06 19:53:20,630 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3062 transitions. Word has length 623 [2024-11-06 19:53:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:20,631 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3062 transitions. [2024-11-06 19:53:20,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 19:53:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3062 transitions. [2024-11-06 19:53:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2024-11-06 19:53:20,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:20,639 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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 19:53:20,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:53:20,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 19:53:20,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:20,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1968814362, now seen corresponding path program 1 times [2024-11-06 19:53:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606419535] [2024-11-06 19:53:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 1214 proven. 155 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-06 19:53:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606419535] [2024-11-06 19:53:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606419535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:53:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852765189] [2024-11-06 19:53:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:53:21,156 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 19:53:21,157 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 19:53:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:21,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:53:21,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:53:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-11-06 19:53:21,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:53:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852765189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:53:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:53:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900371087] [2024-11-06 19:53:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:21,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:21,394 INFO L87 Difference]: Start difference. First operand 2852 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 19:53:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:21,723 INFO L93 Difference]: Finished difference Result 3210 states and 3435 transitions. [2024-11-06 19:53:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 770 [2024-11-06 19:53:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:21,730 INFO L225 Difference]: With dead ends: 3210 [2024-11-06 19:53:21,730 INFO L226 Difference]: Without dead ends: 3208 [2024-11-06 19:53:21,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:21,731 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:21,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 16 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 19:53:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-06 19:53:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2674. [2024-11-06 19:53:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0695847362514028) internal successors, (2859), 2673 states have internal predecessors, (2859), 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 19:53:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2024-11-06 19:53:21,758 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 770 [2024-11-06 19:53:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:21,758 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2024-11-06 19:53:21,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 19:53:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2024-11-06 19:53:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2024-11-06 19:53:21,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:21,771 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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 19:53:21,786 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 19:53:21,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:21,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:21,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1961672119, now seen corresponding path program 1 times [2024-11-06 19:53:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29978572] [2024-11-06 19:53:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1244 proven. 155 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-06 19:53:22,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:22,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29978572] [2024-11-06 19:53:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29978572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:53:22,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567682711] [2024-11-06 19:53:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:53:22,257 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 19:53:22,258 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 19:53:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:22,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:53:22,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:53:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-11-06 19:53:22,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:53:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567682711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:22,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:53:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:53:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122908550] [2024-11-06 19:53:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:22,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:22,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:22,491 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 19:53:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:22,814 INFO L93 Difference]: Finished difference Result 6412 states and 6926 transitions. [2024-11-06 19:53:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:22,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 776 [2024-11-06 19:53:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:22,815 INFO L225 Difference]: With dead ends: 6412 [2024-11-06 19:53:22,815 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:53:22,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:53:22,818 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:22,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 229 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 19:53:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:53:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:53:22,819 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 19:53:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:53:22,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 776 [2024-11-06 19:53:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:53:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 19:53:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:53:22,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:53:22,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:53:22,835 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 19:53:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:23,029 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:23,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:53:23,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:53:23,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:53:23 BoogieIcfgContainer [2024-11-06 19:53:23,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:53:23,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:53:23,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:53:23,348 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:53:23,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:53:10" (3/4) ... [2024-11-06 19:53:23,350 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:53:23,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:53:23,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:53:23,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:53:23,369 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:53:23,470 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:53:23,470 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:53:23,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:53:23,471 INFO L158 Benchmark]: Toolchain (without parser) took 14038.62ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 89.7MB in the beginning and 304.3MB in the end (delta: -214.6MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,471 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:53:23,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.18ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 58.0MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.34ms. Allocated memory is still 117.4MB. Free memory was 58.0MB in the beginning and 48.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,472 INFO L158 Benchmark]: Boogie Preprocessor took 114.17ms. Allocated memory is still 117.4MB. Free memory was 48.6MB in the beginning and 78.7MB in the end (delta: -30.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,472 INFO L158 Benchmark]: RCFGBuilder took 951.42ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 105.5MB in the end (delta: -27.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,472 INFO L158 Benchmark]: TraceAbstraction took 12376.15ms. Allocated memory was 159.4MB in the beginning and 419.4MB in the end (delta: 260.0MB). Free memory was 105.5MB in the beginning and 316.6MB in the end (delta: -211.1MB). Peak memory consumption was 232.7MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,473 INFO L158 Benchmark]: Witness Printer took 122.52ms. Allocated memory is still 419.4MB. Free memory was 316.6MB in the beginning and 304.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:53:23,475 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.52ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.18ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 58.0MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.34ms. Allocated memory is still 117.4MB. Free memory was 58.0MB in the beginning and 48.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.17ms. Allocated memory is still 117.4MB. Free memory was 48.6MB in the beginning and 78.7MB in the end (delta: -30.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * RCFGBuilder took 951.42ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 105.5MB in the end (delta: -27.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12376.15ms. Allocated memory was 159.4MB in the beginning and 419.4MB in the end (delta: 260.0MB). Free memory was 105.5MB in the beginning and 316.6MB in the end (delta: -211.1MB). Peak memory consumption was 232.7MB. Max. memory is 16.1GB. * Witness Printer took 122.52ms. Allocated memory is still 419.4MB. Free memory was 316.6MB in the beginning and 304.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2087 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2087 mSDsluCounter, 1789 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 912 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7254 IncrementalHoareTripleChecker+Invalid, 8166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 912 mSolverCounterUnsat, 1709 mSDtfsCounter, 7254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2209 GetRequests, 2185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3564occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2498 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 7140 NumberOfCodeBlocks, 7140 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7123 ConstructedInterpolants, 0 QuantifiedInterpolants, 14982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2692 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 12598/13018 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((((long long) 49 + a12) <= 0) && (a15 <= 5))) || (((a21 <= 9) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a15 <= 5))) || (((a12 <= 11) && (9 <= a21)) && (a24 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:53:23,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE