./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ss2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:41:54,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:41:54,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:41:54,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:41:54,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:41:54,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:41:54,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:41:54,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:41:54,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:41:54,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:41:54,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:41:54,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:41:54,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:41:54,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:41:54,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:41:54,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:41:54,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:41:54,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:41:54,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:41:54,698 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/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 -> e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 [2025-03-03 09:41:54,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:41:54,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:41:54,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:41:54,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:41:54,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:41:54,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss2.c [2025-03-03 09:41:56,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775092d6/07f740ba565948e9ab8cf0245d361720/FLAG463e11d7a [2025-03-03 09:41:56,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:41:56,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2025-03-03 09:41:56,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775092d6/07f740ba565948e9ab8cf0245d361720/FLAG463e11d7a [2025-03-03 09:41:56,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775092d6/07f740ba565948e9ab8cf0245d361720 [2025-03-03 09:41:56,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:41:56,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:41:56,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:41:56,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:41:56,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:41:56,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6174b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56, skipping insertion in model container [2025-03-03 09:41:56,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:41:56,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c[586,599] [2025-03-03 09:41:56,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:41:56,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:41:56,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c[586,599] [2025-03-03 09:41:56,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:41:56,792 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:41:56,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56 WrapperNode [2025-03-03 09:41:56,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:41:56,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:41:56,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:41:56,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:41:56,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,819 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2025-03-03 09:41:56,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:41:56,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:41:56,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:41:56,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:41:56,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,847 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 6, 9, 7]. 38 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0]. The 7 writes are split as follows [0, 0, 4, 3]. [2025-03-03 09:41:56,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:41:56,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:41:56,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:41:56,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:41:56,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (1/1) ... [2025-03-03 09:41:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:41:56,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:56,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:41:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:41:56,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:41:56,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:41:56,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:41:57,091 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:41:57,097 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 09:41:57,097 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:41:57,103 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:41:57,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:41:57,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:57 BoogieIcfgContainer [2025-03-03 09:41:57,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:41:57,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:41:57,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:41:57,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:41:57,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:41:56" (1/3) ... [2025-03-03 09:41:57,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680cadc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:57, skipping insertion in model container [2025-03-03 09:41:57,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:56" (2/3) ... [2025-03-03 09:41:57,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680cadc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:57, skipping insertion in model container [2025-03-03 09:41:57,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:57" (3/3) ... [2025-03-03 09:41:57,110 INFO L128 eAbstractionObserver]: Analyzing ICFG ss2.c [2025-03-03 09:41:57,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:41:57,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ss2.c that has 1 procedures, 19 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 09:41:57,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:41:57,169 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;@603b1a90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:41:57,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:41:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:41:57,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:57,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:57,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 791692370, now seen corresponding path program 1 times [2025-03-03 09:41:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174113164] [2025-03-03 09:41:57,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:41:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:41:57,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:41:57,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174113164] [2025-03-03 09:41:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174113164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:41:57,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:41:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:41:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980385626] [2025-03-03 09:41:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:41:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:41:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:57,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:41:57,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:41:57,329 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:57,336 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2025-03-03 09:41:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:41:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-03 09:41:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:57,341 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:41:57,341 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 09:41:57,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:41:57,347 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:57,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:41:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 09:41:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 09:41:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-03 09:41:57,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 14 [2025-03-03 09:41:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-03 09:41:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2025-03-03 09:41:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:41:57,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:57,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:57,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:41:57,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:57,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1005258989, now seen corresponding path program 1 times [2025-03-03 09:41:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395354530] [2025-03-03 09:41:57,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:41:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:57,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:41:57,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:41:57,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395354530] [2025-03-03 09:41:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395354530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:41:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:41:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:41:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731192136] [2025-03-03 09:41:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:41:57,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:41:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:57,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:41:57,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:41:57,501 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:57,554 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2025-03-03 09:41:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:41:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-03 09:41:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:57,555 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:41:57,555 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:41:57,555 INFO L434 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 [2025-03-03 09:41:57,556 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:57,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:41:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:41:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-03 09:41:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 09:41:57,564 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2025-03-03 09:41:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:57,564 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 09:41:57,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 09:41:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:41:57,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:57,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:57,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:41:57,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -141217005, now seen corresponding path program 1 times [2025-03-03 09:41:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514331746] [2025-03-03 09:41:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:41:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:57,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:41:57,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:41:57,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:57,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:41:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842399079] [2025-03-03 09:41:57,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:41:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:57,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:57,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:41:57,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:41:57,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:41:57,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:57,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 09:41:57,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:57,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:57,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:57,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:57,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:58,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:58,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:58,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:58,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-03 09:41:58,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-03 09:41:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514331746] [2025-03-03 09:41:58,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:41:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842399079] [2025-03-03 09:41:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842399079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:58,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:41:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2025-03-03 09:41:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820004867] [2025-03-03 09:41:58,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:58,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 09:41:58,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:58,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 09:41:58,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:41:58,629 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:59,281 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-03 09:41:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 09:41:59,281 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 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 20 [2025-03-03 09:41:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:59,283 INFO L225 Difference]: With dead ends: 60 [2025-03-03 09:41:59,284 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 09:41:59,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:41:59,286 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:59,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 97 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:41:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 09:41:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2025-03-03 09:41:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-03 09:41:59,296 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2025-03-03 09:41:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:59,296 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-03 09:41:59,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-03 09:41:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:41:59,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:59,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:59,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:41:59,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:59,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:59,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash 834328244, now seen corresponding path program 2 times [2025-03-03 09:41:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345853741] [2025-03-03 09:41:59,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:59,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 09:41:59,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:41:59,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:41:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345853741] [2025-03-03 09:41:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345853741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392280476] [2025-03-03 09:41:59,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:59,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:59,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:59,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:41:59,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 09:41:59,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:41:59,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:59,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:59,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:41:59,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:41:59,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:41:59,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392280476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:59,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:59,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:41:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703643325] [2025-03-03 09:41:59,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:59,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:41:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:59,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:41:59,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:41:59,769 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:59,946 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2025-03-03 09:41:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:41:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2025-03-03 09:41:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:59,947 INFO L225 Difference]: With dead ends: 79 [2025-03-03 09:41:59,947 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:41:59,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:41:59,947 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:59,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 47 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:41:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2025-03-03 09:41:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-03-03 09:41:59,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 21 [2025-03-03 09:41:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:59,960 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-03 09:41:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2025-03-03 09:41:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:41:59,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:59,961 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:59,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:42:00,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:42:00,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:00,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1759980339, now seen corresponding path program 3 times [2025-03-03 09:42:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591095690] [2025-03-03 09:42:00,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:42:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:00,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-03 09:42:00,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:42:00,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:42:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:42:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591095690] [2025-03-03 09:42:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591095690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137317442] [2025-03-03 09:42:00,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:42:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:00,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:00,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:42:00,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-03 09:42:00,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:42:00,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:42:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:00,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:42:00,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:42:00,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:42:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137317442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:00,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2025-03-03 09:42:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818259133] [2025-03-03 09:42:00,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:42:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:00,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:42:00,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:42:00,450 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:00,658 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2025-03-03 09:42:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:42:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 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 22 [2025-03-03 09:42:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:00,659 INFO L225 Difference]: With dead ends: 110 [2025-03-03 09:42:00,659 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 09:42:00,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:42:00,660 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:00,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 62 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 09:42:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2025-03-03 09:42:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-03 09:42:00,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 22 [2025-03-03 09:42:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-03 09:42:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-03 09:42:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:42:00,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:00,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:00,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:42:00,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:00,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1322834899, now seen corresponding path program 4 times [2025-03-03 09:42:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:00,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006086874] [2025-03-03 09:42:00,889 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:42:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:00,897 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:42:00,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:42:00,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:42:00,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:42:00,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444037580] [2025-03-03 09:42:00,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:42:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:00,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:00,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:42:00,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:42:01,038 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:42:01,038 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:42:01,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:01,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-03 09:42:01,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:01,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:42:01,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-03 09:42:01,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-03 09:42:01,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-03 09:42:01,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-03 09:42:01,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:42:01,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:42:01,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:42:01,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:42:01,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:42:01,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:42:01,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:42:01,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:42:01,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-03-03 09:42:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:01,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006086874] [2025-03-03 09:42:02,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:42:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444037580] [2025-03-03 09:42:02,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444037580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:02,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:42:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2025-03-03 09:42:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465482771] [2025-03-03 09:42:02,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:02,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:42:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:02,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:42:02,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:42:02,496 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:03,541 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-03-03 09:42:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 09:42:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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 26 [2025-03-03 09:42:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:03,542 INFO L225 Difference]: With dead ends: 79 [2025-03-03 09:42:03,542 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 09:42:03,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 09:42:03,544 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:03,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:42:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 09:42:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2025-03-03 09:42:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-03 09:42:03,561 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 26 [2025-03-03 09:42:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:03,561 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-03 09:42:03,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-03 09:42:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:42:03,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:03,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:03,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:42:03,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:03,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:03,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash 73494483, now seen corresponding path program 5 times [2025-03-03 09:42:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493374286] [2025-03-03 09:42:03,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:42:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:03,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-03 09:42:03,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:42:03,788 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:42:03,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493374286] [2025-03-03 09:42:03,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493374286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917104049] [2025-03-03 09:42:03,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:42:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:03,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:03,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:42:03,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-03 09:42:04,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:42:04,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:42:04,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:04,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:42:04,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:04,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917104049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:04,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:42:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52959909] [2025-03-03 09:42:04,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:04,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:42:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:04,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:42:04,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:42:04,063 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:04,222 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2025-03-03 09:42:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:42:04,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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 28 [2025-03-03 09:42:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:04,222 INFO L225 Difference]: With dead ends: 101 [2025-03-03 09:42:04,222 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 09:42:04,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:42:04,223 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:04,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 09:42:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2025-03-03 09:42:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-03 09:42:04,234 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 28 [2025-03-03 09:42:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:04,234 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-03 09:42:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-03 09:42:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:42:04,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:04,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:04,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:42:04,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:04,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2044559176, now seen corresponding path program 1 times [2025-03-03 09:42:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:04,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774103195] [2025-03-03 09:42:04,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:04,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:42:04,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:42:04,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:04,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat