./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem01_label25.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', '9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label25.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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:53:55,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:53:55,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:53:55,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:53:55,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:53:55,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:53:55,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:53:55,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:53:55,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:53:55,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:53:55,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:53:55,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:53:55,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:53:55,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:53:55,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:53:55,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:53:55,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:53:55,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:53:55,839 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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 [2024-11-06 18:53:56,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:53:56,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:53:56,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:53:56,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:53:56,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:53:56,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-11-06 18:53:57,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:53:57,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:53:57,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-11-06 18:53:57,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa6fe5307/86ea66bcb8fe45198b9de6aec51530bc/FLAGe38912f76 [2024-11-06 18:53:57,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa6fe5307/86ea66bcb8fe45198b9de6aec51530bc [2024-11-06 18:53:57,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:53:57,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:53:57,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:53:57,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:53:57,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:53:57,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:57" (1/1) ... [2024-11-06 18:53:57,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398de71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:57, skipping insertion in model container [2024-11-06 18:53:57,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:57" (1/1) ... [2024-11-06 18:53:58,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:53:58,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-06 18:53:58,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:53:58,355 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:53:58,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-06 18:53:58,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:53:58,472 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:53:58,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58 WrapperNode [2024-11-06 18:53:58,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:53:58,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:53:58,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:53:58,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:53:58,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,560 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-06 18:53:58,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:53:58,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:53:58,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:53:58,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:53:58,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 18:53:58,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:53:58,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:53:58,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:53:58,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:53:58,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (1/1) ... [2024-11-06 18:53:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:53:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:53:58,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 18:53:58,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 18:53:58,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:53:58,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:53:58,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:53:58,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:53:58,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:53:58,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:53:59,765 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-06 18:53:59,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:53:59,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:53:59,783 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:53:59,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:59 BoogieIcfgContainer [2024-11-06 18:53:59,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:53:59,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:53:59,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:53:59,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:53:59,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:53:57" (1/3) ... [2024-11-06 18:53:59,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5622531a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:59, skipping insertion in model container [2024-11-06 18:53:59,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:58" (2/3) ... [2024-11-06 18:53:59,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5622531a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:59, skipping insertion in model container [2024-11-06 18:53:59,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:59" (3/3) ... [2024-11-06 18:53:59,794 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2024-11-06 18:53:59,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:53:59,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:53:59,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:53:59,895 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;@311dced5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:53:59,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:53:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:53:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 18:53:59,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:53:59,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:53:59,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:53:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:53:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash -278930290, now seen corresponding path program 1 times [2024-11-06 18:53:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:53:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269052636] [2024-11-06 18:53:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:53:59,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269052636] [2024-11-06 18:54:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269052636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465579917] [2024-11-06 18:54:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:00,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:00,883 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:01,996 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2024-11-06 18:54:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:54:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-06 18:54:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:02,010 INFO L225 Difference]: With dead ends: 662 [2024-11-06 18:54:02,011 INFO L226 Difference]: Without dead ends: 397 [2024-11-06 18:54:02,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:02,016 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 317 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:02,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 18:54:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-06 18:54:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-06 18:54:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2024-11-06 18:54:02,075 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 119 [2024-11-06 18:54:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2024-11-06 18:54:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2024-11-06 18:54:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-06 18:54:02,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:02,079 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:02,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:54:02,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -876569957, now seen corresponding path program 1 times [2024-11-06 18:54:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428404856] [2024-11-06 18:54:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428404856] [2024-11-06 18:54:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428404856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540322356] [2024-11-06 18:54:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:02,640 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:03,316 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2024-11-06 18:54:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:03,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-06 18:54:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:03,320 INFO L225 Difference]: With dead ends: 887 [2024-11-06 18:54:03,320 INFO L226 Difference]: Without dead ends: 528 [2024-11-06 18:54:03,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:03,325 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 129 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:03,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 81 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-06 18:54:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2024-11-06 18:54:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2024-11-06 18:54:03,352 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 126 [2024-11-06 18:54:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2024-11-06 18:54:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2024-11-06 18:54:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-06 18:54:03,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:03,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:54:03,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:03,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741917, now seen corresponding path program 1 times [2024-11-06 18:54:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912180703] [2024-11-06 18:54:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 18:54:03,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912180703] [2024-11-06 18:54:03,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912180703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:03,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967272861] [2024-11-06 18:54:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:03,570 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:03,943 INFO L93 Difference]: Finished difference Result 923 states and 1105 transitions. [2024-11-06 18:54:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 134 [2024-11-06 18:54:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:03,946 INFO L225 Difference]: With dead ends: 923 [2024-11-06 18:54:03,946 INFO L226 Difference]: Without dead ends: 528 [2024-11-06 18:54:03,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:03,948 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:03,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 46 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-06 18:54:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-06 18:54:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions. [2024-11-06 18:54:03,973 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 134 [2024-11-06 18:54:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:03,973 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 617 transitions. [2024-11-06 18:54:03,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions. [2024-11-06 18:54:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-06 18:54:03,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:03,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:03,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:54:03,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1083646213, now seen corresponding path program 1 times [2024-11-06 18:54:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463779534] [2024-11-06 18:54:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 18:54:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463779534] [2024-11-06 18:54:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463779534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966326787] [2024-11-06 18:54:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:04,111 INFO L87 Difference]: Start difference. First operand 528 states and 617 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:04,483 INFO L93 Difference]: Finished difference Result 1578 states and 1846 transitions. [2024-11-06 18:54:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 143 [2024-11-06 18:54:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:04,489 INFO L225 Difference]: With dead ends: 1578 [2024-11-06 18:54:04,489 INFO L226 Difference]: Without dead ends: 1052 [2024-11-06 18:54:04,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:04,491 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:04,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-06 18:54:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2024-11-06 18:54:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1880434782608695) internal successors, (1093), 920 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1093 transitions. [2024-11-06 18:54:04,526 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1093 transitions. Word has length 143 [2024-11-06 18:54:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1093 transitions. [2024-11-06 18:54:04,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1093 transitions. [2024-11-06 18:54:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-06 18:54:04,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:04,530 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:04,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:54:04,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:04,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:04,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1705683237, now seen corresponding path program 1 times [2024-11-06 18:54:04,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:04,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718570585] [2024-11-06 18:54:04,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:04,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 18:54:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718570585] [2024-11-06 18:54:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718570585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:04,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:04,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758295843] [2024-11-06 18:54:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:04,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:04,741 INFO L87 Difference]: Start difference. First operand 921 states and 1093 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:05,311 INFO L93 Difference]: Finished difference Result 2364 states and 2853 transitions. [2024-11-06 18:54:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 168 [2024-11-06 18:54:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:05,317 INFO L225 Difference]: With dead ends: 2364 [2024-11-06 18:54:05,317 INFO L226 Difference]: Without dead ends: 1445 [2024-11-06 18:54:05,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:05,322 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:05,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 35 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-06 18:54:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1052. [2024-11-06 18:54:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1722169362511894) internal successors, (1232), 1051 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1232 transitions. [2024-11-06 18:54:05,351 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1232 transitions. Word has length 168 [2024-11-06 18:54:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:05,352 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1232 transitions. [2024-11-06 18:54:05,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1232 transitions. [2024-11-06 18:54:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-06 18:54:05,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:05,360 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:05,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:54:05,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:05,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash 130602462, now seen corresponding path program 1 times [2024-11-06 18:54:05,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526019359] [2024-11-06 18:54:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 18:54:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526019359] [2024-11-06 18:54:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526019359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444319038] [2024-11-06 18:54:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:05,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:05,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:05,646 INFO L87 Difference]: Start difference. First operand 1052 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:06,216 INFO L93 Difference]: Finished difference Result 2626 states and 3090 transitions. [2024-11-06 18:54:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:06,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 182 [2024-11-06 18:54:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:06,223 INFO L225 Difference]: With dead ends: 2626 [2024-11-06 18:54:06,224 INFO L226 Difference]: Without dead ends: 1576 [2024-11-06 18:54:06,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:06,226 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 346 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:06,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 43 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-06 18:54:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-06 18:54:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.164819944598338) internal successors, (1682), 1444 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2024-11-06 18:54:06,255 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 182 [2024-11-06 18:54:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2024-11-06 18:54:06,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2024-11-06 18:54:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-06 18:54:06,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:06,260 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:06,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:54:06,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1762338717, now seen corresponding path program 1 times [2024-11-06 18:54:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076315877] [2024-11-06 18:54:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-06 18:54:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076315877] [2024-11-06 18:54:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076315877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037504961] [2024-11-06 18:54:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:06,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:06,532 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:07,157 INFO L93 Difference]: Finished difference Result 3281 states and 3801 transitions. [2024-11-06 18:54:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:07,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-11-06 18:54:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:07,165 INFO L225 Difference]: With dead ends: 3281 [2024-11-06 18:54:07,166 INFO L226 Difference]: Without dead ends: 1838 [2024-11-06 18:54:07,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:07,169 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:07,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 33 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-06 18:54:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2024-11-06 18:54:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1498412698412699) internal successors, (1811), 1575 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1811 transitions. [2024-11-06 18:54:07,204 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1811 transitions. Word has length 224 [2024-11-06 18:54:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:07,205 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1811 transitions. [2024-11-06 18:54:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1811 transitions. [2024-11-06 18:54:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-06 18:54:07,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:07,211 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:54:07,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1503446723, now seen corresponding path program 1 times [2024-11-06 18:54:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847255689] [2024-11-06 18:54:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 18:54:07,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847255689] [2024-11-06 18:54:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847255689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233224693] [2024-11-06 18:54:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:07,398 INFO L87 Difference]: Start difference. First operand 1576 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:07,800 INFO L93 Difference]: Finished difference Result 3412 states and 3893 transitions. [2024-11-06 18:54:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 267 [2024-11-06 18:54:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:07,807 INFO L225 Difference]: With dead ends: 3412 [2024-11-06 18:54:07,808 INFO L226 Difference]: Without dead ends: 1838 [2024-11-06 18:54:07,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:07,810 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:07,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 178 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-06 18:54:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-06 18:54:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1201641266119577) internal successors, (1911), 1706 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1911 transitions. [2024-11-06 18:54:07,844 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1911 transitions. Word has length 267 [2024-11-06 18:54:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1911 transitions. [2024-11-06 18:54:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1911 transitions. [2024-11-06 18:54:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-06 18:54:07,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:07,851 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:07,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:54:07,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 534666374, now seen corresponding path program 1 times [2024-11-06 18:54:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26300444] [2024-11-06 18:54:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-06 18:54:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26300444] [2024-11-06 18:54:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26300444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215599141] [2024-11-06 18:54:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:08,462 INFO L87 Difference]: Start difference. First operand 1707 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:09,071 INFO L93 Difference]: Finished difference Result 3543 states and 3954 transitions. [2024-11-06 18:54:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 289 [2024-11-06 18:54:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:09,078 INFO L225 Difference]: With dead ends: 3543 [2024-11-06 18:54:09,079 INFO L226 Difference]: Without dead ends: 1838 [2024-11-06 18:54:09,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:09,081 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:09,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 48 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-06 18:54:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-06 18:54:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.100234466588511) internal successors, (1877), 1706 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2024-11-06 18:54:09,118 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 289 [2024-11-06 18:54:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:09,121 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2024-11-06 18:54:09,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2024-11-06 18:54:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-06 18:54:09,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:09,126 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:54:09,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -427431724, now seen corresponding path program 1 times [2024-11-06 18:54:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555854353] [2024-11-06 18:54:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-06 18:54:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555854353] [2024-11-06 18:54:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555854353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821345347] [2024-11-06 18:54:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:09,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:09,375 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:09,739 INFO L93 Difference]: Finished difference Result 3803 states and 4172 transitions. [2024-11-06 18:54:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 309 [2024-11-06 18:54:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:09,740 INFO L225 Difference]: With dead ends: 3803 [2024-11-06 18:54:09,740 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:54:09,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:09,746 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:09,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:54:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:54:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:54:09,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2024-11-06 18:54:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:54:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:54:09,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:54:09,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:54:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:54:09,756 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:09,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:54:10,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:54:10,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:54:10 BoogieIcfgContainer [2024-11-06 18:54:10,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:54:10,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:54:10,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:54:10,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:54:10,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:59" (3/4) ... [2024-11-06 18:54:10,117 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:54:10,137 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:54:10,138 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:54:10,139 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:54:10,139 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:54:10,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:54:10,277 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:54:10,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:54:10,278 INFO L158 Benchmark]: Toolchain (without parser) took 12312.70ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 75.6MB in the beginning and 206.6MB in the end (delta: -130.9MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,279 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:10,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.69ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 48.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.47ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 43.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,280 INFO L158 Benchmark]: Boogie Preprocessor took 95.28ms. Allocated memory is still 100.7MB. Free memory was 43.3MB in the beginning and 38.5MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:10,280 INFO L158 Benchmark]: RCFGBuilder took 1127.46ms. Allocated memory is still 100.7MB. Free memory was 38.5MB in the beginning and 32.5MB in the end (delta: 5.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,280 INFO L158 Benchmark]: TraceAbstraction took 10328.03ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 32.0MB in the beginning and 217.4MB in the end (delta: -185.4MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,280 INFO L158 Benchmark]: Witness Printer took 161.90ms. Allocated memory is still 276.8MB. Free memory was 217.4MB in the beginning and 206.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,282 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.18ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.69ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 48.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.47ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 43.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.28ms. Allocated memory is still 100.7MB. Free memory was 43.3MB in the beginning and 38.5MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1127.46ms. Allocated memory is still 100.7MB. Free memory was 38.5MB in the beginning and 32.5MB in the end (delta: 5.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10328.03ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 32.0MB in the beginning and 217.4MB in the end (delta: -185.4MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. * Witness Printer took 161.90ms. Allocated memory is still 276.8MB. Free memory was 217.4MB in the beginning and 206.6MB in the end (delta: 10.8MB). 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: 543]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1861 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1861 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 835 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4571 IncrementalHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 835 mSolverCounterUnsat, 661 mSDtfsCounter, 4571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1951 ConstructedInterpolants, 0 QuantifiedInterpolants, 7023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 1728/1728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((a21 == 1) && (a16 <= 5)) || ((a8 <= 13) && (a20 == 1))) || ((a7 != 1) && (a21 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:54:10,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE