./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i -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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:51:39,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:51:39,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:51:39,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:51:39,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:51:39,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:51:39,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:51:39,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:51:39,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:51:39,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:51:39,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:51:39,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:51:39,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:51:39,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:51:39,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:51:39,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:51:39,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:51:39,695 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2025-03-08 13:51:39,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:51:39,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:51:39,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:51:39,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:51:39,916 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:51:39,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:41,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1dc17354/9d2673af559d4880adb451f7753cbc03/FLAG90f5e58fa [2025-03-08 13:51:41,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:51:41,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:41,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1dc17354/9d2673af559d4880adb451f7753cbc03/FLAG90f5e58fa [2025-03-08 13:51:41,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1dc17354/9d2673af559d4880adb451f7753cbc03 [2025-03-08 13:51:41,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:51:41,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:51:41,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:51:41,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:51:41,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:51:41,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71aa2437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41, skipping insertion in model container [2025-03-08 13:51:41,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:51:41,781 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-03-08 13:51:41,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:51:41,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:51:41,824 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-03-08 13:51:41,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:51:41,862 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:51:41,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41 WrapperNode [2025-03-08 13:51:41,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:51:41,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:51:41,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:51:41,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:51:41,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,892 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-08 13:51:41,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:51:41,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:51:41,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:51:41,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:51:41,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,912 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:51:41,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:51:41,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:51:41,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:51:41,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:51:41,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (1/1) ... [2025-03-08 13:51:41,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:51:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:41,949 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-08 13:51:41,951 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-08 13:51:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:51:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:51:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:51:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:51:41,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:51:42,020 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:51:42,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:51:42,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short13#1; [2025-03-08 13:51:42,251 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 13:51:42,251 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:51:42,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:51:42,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:51:42,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:42 BoogieIcfgContainer [2025-03-08 13:51:42,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:51:42,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:51:42,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:51:42,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:51:42,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:51:41" (1/3) ... [2025-03-08 13:51:42,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b049d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:42, skipping insertion in model container [2025-03-08 13:51:42,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:41" (2/3) ... [2025-03-08 13:51:42,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b049d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:42, skipping insertion in model container [2025-03-08 13:51:42,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:42" (3/3) ... [2025-03-08 13:51:42,281 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:42,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:51:42,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-83.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:51:42,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:51:42,366 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;@5cedf738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:51:42,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:51:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 13:51:42,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:42,379 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:42,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:42,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash -997037989, now seen corresponding path program 1 times [2025-03-08 13:51:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391755536] [2025-03-08 13:51:42,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 13:51:42,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 13:51:42,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:42,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 13:51:42,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391755536] [2025-03-08 13:51:42,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391755536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:51:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12341530] [2025-03-08 13:51:42,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:42,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:51:42,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:42,562 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-08 13:51:42,564 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-08 13:51:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 13:51:42,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 13:51:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:42,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:51:42,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:51:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 13:51:42,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:51:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12341530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:51:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:51:42,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720567791] [2025-03-08 13:51:42,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:42,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:51:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:42,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:51:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:51:42,715 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:42,733 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2025-03-08 13:51:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:51:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2025-03-08 13:51:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:42,739 INFO L225 Difference]: With dead ends: 108 [2025-03-08 13:51:42,739 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 13:51:42,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-08 13:51:42,745 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:42,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 13:51:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 13:51:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-08 13:51:42,773 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 88 [2025-03-08 13:51:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:42,774 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-08 13:51:42,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-08 13:51:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 13:51:42,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:42,777 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:42,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:51:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:51:42,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1018948515, now seen corresponding path program 1 times [2025-03-08 13:51:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109155414] [2025-03-08 13:51:42,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:42,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 13:51:43,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 13:51:43,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:43,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109155414] [2025-03-08 13:51:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109155414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:51:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726946089] [2025-03-08 13:51:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:43,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:51:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:43,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:51:43,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:43,173 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:43,214 INFO L93 Difference]: Finished difference Result 130 states and 190 transitions. [2025-03-08 13:51:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:51:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-03-08 13:51:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:43,216 INFO L225 Difference]: With dead ends: 130 [2025-03-08 13:51:43,216 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 13:51:43,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:43,217 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:43,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 140 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 13:51:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2025-03-08 13:51:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2025-03-08 13:51:43,231 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 88 [2025-03-08 13:51:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:43,233 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-03-08 13:51:43,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2025-03-08 13:51:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 13:51:43,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:43,235 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:51:43,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1820761690, now seen corresponding path program 1 times [2025-03-08 13:51:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534080756] [2025-03-08 13:51:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 13:51:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 13:51:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534080756] [2025-03-08 13:51:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534080756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:51:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012532268] [2025-03-08 13:51:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:51:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:43,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:51:43,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:51:43,441 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:43,498 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2025-03-08 13:51:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:51:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-03-08 13:51:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:43,500 INFO L225 Difference]: With dead ends: 107 [2025-03-08 13:51:43,501 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 13:51:43,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:51:43,501 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:43,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 190 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 13:51:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 13:51:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-03-08 13:51:43,507 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 89 [2025-03-08 13:51:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-03-08 13:51:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-03-08 13:51:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 13:51:43,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:43,508 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:51:43,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1933916743, now seen corresponding path program 1 times [2025-03-08 13:51:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640403960] [2025-03-08 13:51:43,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 13:51:43,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 13:51:43,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:43,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640403960] [2025-03-08 13:51:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640403960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:51:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253928057] [2025-03-08 13:51:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:51:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:51:45,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:51:45,382 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:45,848 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2025-03-08 13:51:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:51:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-03-08 13:51:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:45,850 INFO L225 Difference]: With dead ends: 140 [2025-03-08 13:51:45,852 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 13:51:45,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:51:45,853 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 96 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:45,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 222 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:51:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 13:51:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2025-03-08 13:51:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-03-08 13:51:45,864 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 90 [2025-03-08 13:51:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:45,864 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-03-08 13:51:45,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-03-08 13:51:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 13:51:45,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:45,865 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:45,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:51:45,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:45,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1482557543, now seen corresponding path program 1 times [2025-03-08 13:51:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954089971] [2025-03-08 13:51:45,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:45,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 13:51:45,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 13:51:45,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:45,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954089971] [2025-03-08 13:51:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954089971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:51:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460365318] [2025-03-08 13:51:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:46,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:51:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:46,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:51:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:51:46,625 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:46,944 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2025-03-08 13:51:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:51:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-08 13:51:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:46,946 INFO L225 Difference]: With dead ends: 170 [2025-03-08 13:51:46,946 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 13:51:46,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:51:46,947 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:46,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 433 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:51:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 13:51:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2025-03-08 13:51:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-03-08 13:51:46,954 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 91 [2025-03-08 13:51:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:46,957 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-03-08 13:51:46,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-03-08 13:51:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 13:51:46,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:46,960 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:51:46,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:46,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1988116168, now seen corresponding path program 1 times [2025-03-08 13:51:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493542646] [2025-03-08 13:51:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:46,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 13:51:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 13:51:46,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:48,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493542646] [2025-03-08 13:51:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493542646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:48,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:48,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:51:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579510529] [2025-03-08 13:51:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:51:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:48,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:51:48,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:51:48,947 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:50,184 INFO L93 Difference]: Finished difference Result 169 states and 226 transitions. [2025-03-08 13:51:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:51:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-08 13:51:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:50,186 INFO L225 Difference]: With dead ends: 169 [2025-03-08 13:51:50,187 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 13:51:50,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:51:50,188 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 71 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:50,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 513 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 13:51:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 13:51:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2025-03-08 13:51:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2025-03-08 13:51:50,193 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 91 [2025-03-08 13:51:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:50,193 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2025-03-08 13:51:50,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2025-03-08 13:51:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:51:50,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:50,194 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:50,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:51:50,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:50,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 658112270, now seen corresponding path program 1 times [2025-03-08 13:51:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142074801] [2025-03-08 13:51:50,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:51:50,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:51:50,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:50,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142074801] [2025-03-08 13:51:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142074801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:51:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087472786] [2025-03-08 13:51:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:51:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:50,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:51:50,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:50,278 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:50,318 INFO L93 Difference]: Finished difference Result 138 states and 181 transitions. [2025-03-08 13:51:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:51:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-08 13:51:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:50,319 INFO L225 Difference]: With dead ends: 138 [2025-03-08 13:51:50,319 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 13:51:50,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:50,320 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:50,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 112 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 13:51:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2025-03-08 13:51:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-03-08 13:51:50,329 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 92 [2025-03-08 13:51:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-03-08 13:51:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-03-08 13:51:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:51:50,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:50,330 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:50,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:51:50,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:50,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1683334319, now seen corresponding path program 1 times [2025-03-08 13:51:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-03-08 13:51:50,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:51:50,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:51:50,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:50,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-03-08 13:51:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353511801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:51:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998749593] [2025-03-08 13:51:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:51:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:50,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:51:50,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:51:50,496 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:50,702 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2025-03-08 13:51:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:51:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-08 13:51:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:50,704 INFO L225 Difference]: With dead ends: 127 [2025-03-08 13:51:50,704 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 13:51:50,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:51:50,705 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 316 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:51:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 13:51:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2025-03-08 13:51:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:51:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2025-03-08 13:51:50,732 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 92 [2025-03-08 13:51:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:50,733 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2025-03-08 13:51:50,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2025-03-08 13:51:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 13:51:50,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:50,733 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:51:50,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 583316942, now seen corresponding path program 1 times [2025-03-08 13:51:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082445281] [2025-03-08 13:51:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:50,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 13:51:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 13:51:50,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:50,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082445281] [2025-03-08 13:51:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082445281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:50,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:51:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948759753] [2025-03-08 13:51:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:51:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:50,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:51:50,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:51:50,807 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:50,873 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2025-03-08 13:51:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:51:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-08 13:51:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:50,875 INFO L225 Difference]: With dead ends: 176 [2025-03-08 13:51:50,875 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 13:51:50,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:51:50,876 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:50,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 153 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:51:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 13:51:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2025-03-08 13:51:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 63 states have internal predecessors, (72), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:51:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-03-08 13:51:50,887 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 93 [2025-03-08 13:51:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:50,887 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-03-08 13:51:50,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-03-08 13:51:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 13:51:50,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:50,889 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:50,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:51:50,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:50,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash -306212079, now seen corresponding path program 1 times [2025-03-08 13:51:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656426398] [2025-03-08 13:51:50,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:50,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 13:51:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 13:51:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656426398] [2025-03-08 13:51:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656426398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:51:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358032398] [2025-03-08 13:51:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:51:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:51,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:51:51,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:51:51,327 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:51,765 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2025-03-08 13:51:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:51:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-08 13:51:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:51,766 INFO L225 Difference]: With dead ends: 132 [2025-03-08 13:51:51,766 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 13:51:51,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:51:51,767 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:51,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 609 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:51:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 13:51:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2025-03-08 13:51:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:51:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2025-03-08 13:51:51,781 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 95 [2025-03-08 13:51:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2025-03-08 13:51:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2025-03-08 13:51:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 13:51:51,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:51,785 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:51:51,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -599615086, now seen corresponding path program 1 times [2025-03-08 13:51:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465955694] [2025-03-08 13:51:51,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 13:51:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 13:51:51,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:51,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465955694] [2025-03-08 13:51:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465955694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:51:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886384402] [2025-03-08 13:51:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:51:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:52,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:51:52,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:51:52,105 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:52,479 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2025-03-08 13:51:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:51:52,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-08 13:51:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:52,481 INFO L225 Difference]: With dead ends: 139 [2025-03-08 13:51:52,481 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 13:51:52,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:51:52,482 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:52,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 533 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:51:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 13:51:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2025-03-08 13:51:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:51:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2025-03-08 13:51:52,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 95 [2025-03-08 13:51:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:52,495 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2025-03-08 13:51:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2025-03-08 13:51:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 13:51:52,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:52,496 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:52,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:51:52,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:52,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash 571407824, now seen corresponding path program 1 times [2025-03-08 13:51:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225856115] [2025-03-08 13:51:52,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:52,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 13:51:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 13:51:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225856115] [2025-03-08 13:51:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225856115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:52,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:51:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942759515] [2025-03-08 13:51:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:51:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:52,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:51:52,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:52,526 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:52,562 INFO L93 Difference]: Finished difference Result 210 states and 268 transitions. [2025-03-08 13:51:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:51:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-08 13:51:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:52,564 INFO L225 Difference]: With dead ends: 210 [2025-03-08 13:51:52,564 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 13:51:52,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:52,565 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:52,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 13:51:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-03-08 13:51:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.120879120879121) internal successors, (102), 93 states have internal predecessors, (102), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 13:51:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2025-03-08 13:51:52,577 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 95 [2025-03-08 13:51:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:52,577 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2025-03-08 13:51:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2025-03-08 13:51:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:51:52,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:52,578 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:52,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:51:52,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:52,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1913632273, now seen corresponding path program 1 times [2025-03-08 13:51:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955662508] [2025-03-08 13:51:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:52,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:51:52,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:51:52,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:52,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955662508] [2025-03-08 13:51:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955662508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:51:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687764158] [2025-03-08 13:51:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:51:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:52,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:51:52,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:52,614 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:52,659 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2025-03-08 13:51:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:51:52,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-08 13:51:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:52,661 INFO L225 Difference]: With dead ends: 247 [2025-03-08 13:51:52,661 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 13:51:52,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:51:52,662 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:52,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 165 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 13:51:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-03-08 13:51:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.10989010989011) internal successors, (101), 93 states have internal predecessors, (101), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 13:51:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2025-03-08 13:51:52,675 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 96 [2025-03-08 13:51:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2025-03-08 13:51:52,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2025-03-08 13:51:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:51:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:52,676 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:52,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 13:51:52,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -944921806, now seen corresponding path program 1 times [2025-03-08 13:51:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25643969] [2025-03-08 13:51:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:51:52,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:51:52,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:52,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25643969] [2025-03-08 13:51:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25643969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:51:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384768901] [2025-03-08 13:51:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:51:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:52,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:51:52,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:51:52,719 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:52,779 INFO L93 Difference]: Finished difference Result 256 states and 321 transitions. [2025-03-08 13:51:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:51:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-08 13:51:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:52,781 INFO L225 Difference]: With dead ends: 256 [2025-03-08 13:51:52,781 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 13:51:52,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:51:52,781 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 18 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:52,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 182 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 13:51:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2025-03-08 13:51:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.098901098901099) internal successors, (100), 93 states have internal predecessors, (100), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 13:51:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2025-03-08 13:51:52,794 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 96 [2025-03-08 13:51:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2025-03-08 13:51:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2025-03-08 13:51:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 13:51:52,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:52,795 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 13:51:52,795 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:52,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1478423343, now seen corresponding path program 1 times [2025-03-08 13:51:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060876292] [2025-03-08 13:51:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:52,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 13:51:52,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 13:51:52,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:52,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060876292] [2025-03-08 13:51:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060876292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:51:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165368156] [2025-03-08 13:51:53,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:53,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:51:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:53,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:51:53,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:51:53,167 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:53,608 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2025-03-08 13:51:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:51:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-03-08 13:51:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:53,610 INFO L225 Difference]: With dead ends: 181 [2025-03-08 13:51:53,610 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 13:51:53,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:51:53,611 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 92 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:53,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 525 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:51:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 13:51:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2025-03-08 13:51:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 13:51:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2025-03-08 13:51:53,632 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 97 [2025-03-08 13:51:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:53,632 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2025-03-08 13:51:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:51:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2025-03-08 13:51:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 13:51:53,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:53,634 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:53,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 13:51:53,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:53,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1983981968, now seen corresponding path program 1 times [2025-03-08 13:51:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319220445] [2025-03-08 13:51:53,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:53,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 13:51:53,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 13:51:53,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:53,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:51:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:51:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319220445] [2025-03-08 13:51:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319220445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:51:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391201589] [2025-03-08 13:51:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:51:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:51:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:51:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:51:53,673 INFO L87 Difference]: Start difference. First operand 143 states and 180 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:53,745 INFO L93 Difference]: Finished difference Result 271 states and 341 transitions. [2025-03-08 13:51:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:51:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2025-03-08 13:51:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:53,748 INFO L225 Difference]: With dead ends: 271 [2025-03-08 13:51:53,748 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 13:51:53,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:51:53,749 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 108 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:51:53,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:51:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 13:51:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2025-03-08 13:51:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:51:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2025-03-08 13:51:53,763 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 97 [2025-03-08 13:51:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:53,764 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2025-03-08 13:51:53,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2025-03-08 13:51:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 13:51:53,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:53,765 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:53,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 13:51:53,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:53,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1068985574, now seen corresponding path program 1 times [2025-03-08 13:51:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:51:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685812695] [2025-03-08 13:51:53,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:51:53,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:51:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:51:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:51:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307528623] [2025-03-08 13:51:53,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:51:53,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:53,798 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-08 13:51:53,800 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-08 13:51:53,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:51:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:51:53,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:53,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:51:53,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:51:53,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 13:51:53,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 13:51:53,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:51:53,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:51:53,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:51:53,925 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:51:53,933 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-08 13:51:54,126 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,SelfDestructingSolverStorable16 [2025-03-08 13:51:54,129 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:54,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:51:54,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:51:54 BoogieIcfgContainer [2025-03-08 13:51:54,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:51:54,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:51:54,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:51:54,199 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:51:54,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:42" (3/4) ... [2025-03-08 13:51:54,202 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:51:54,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:51:54,204 INFO L158 Benchmark]: Toolchain (without parser) took 12521.36ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.7MB in the beginning and 179.9MB in the end (delta: -58.2MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2025-03-08 13:51:54,204 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:51:54,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.28ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 108.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:51:54,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.84ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 105.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:51:54,205 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:51:54,205 INFO L158 Benchmark]: IcfgBuilder took 351.21ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 82.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:51:54,205 INFO L158 Benchmark]: TraceAbstraction took 11922.99ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 81.6MB in the beginning and 180.0MB in the end (delta: -98.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2025-03-08 13:51:54,205 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 293.6MB. Free memory was 180.0MB in the beginning and 179.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:51:54,207 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.28ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 108.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.84ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 105.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 351.21ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 82.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11922.99ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 81.6MB in the beginning and 180.0MB in the end (delta: -98.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 293.6MB. Free memory was 180.0MB in the beginning and 179.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 52, overapproximation of bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] signed long int var_1_8 = 127; [L27] signed long int var_1_10 = 0; [L28] signed long int var_1_11 = 128; [L29] signed long int var_1_12 = 24; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] signed long int var_1_17 = 1; [L34] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=127] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=127] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L78] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L79] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L79] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L83] var_1_16 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L84] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L85] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L85] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L99] RET updateVariables() [L100] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND TRUE var_1_15 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=127] [L54] COND TRUE var_1_1 == stepLocal_1 [L55] var_1_8 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L91] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L91-L92] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((signed long int) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((signed long int) var_1_10)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=3, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 17, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 942 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 942 mSDsluCounter, 4413 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3102 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2825 IncrementalHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1311 mSDtfsCounter, 2825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 332 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1771 NumberOfCodeBlocks, 1771 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1556 ConstructedInterpolants, 0 QuantifiedInterpolants, 5601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 5280/5304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:51:54,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:51:56,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:51:56,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:51:56,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:51:56,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:51:56,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:51:56,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:51:56,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:51:56,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:51:56,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:51:56,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:51:56,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:51:56,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:51:56,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:51:56,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:51:56,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:51:56,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:51:56,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:51:56,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:51:56,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:51:56,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:51:56,136 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2025-03-08 13:51:56,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:51:56,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:51:56,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:51:56,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:51:56,383 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:51:56,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:57,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606dc616e/5ce6583850c24e0aa6ab7c111e93a532/FLAGe81e6e553 [2025-03-08 13:51:57,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:51:57,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:57,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606dc616e/5ce6583850c24e0aa6ab7c111e93a532/FLAGe81e6e553 [2025-03-08 13:51:58,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606dc616e/5ce6583850c24e0aa6ab7c111e93a532 [2025-03-08 13:51:58,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:51:58,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:51:58,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:51:58,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:51:58,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:51:58,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b0aa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58, skipping insertion in model container [2025-03-08 13:51:58,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:51:58,246 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-03-08 13:51:58,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:51:58,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:51:58,291 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-03-08 13:51:58,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:51:58,321 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:51:58,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58 WrapperNode [2025-03-08 13:51:58,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:51:58,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:51:58,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:51:58,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:51:58,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,361 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-08 13:51:58,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:51:58,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:51:58,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:51:58,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:51:58,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,385 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:51:58,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:51:58,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:51:58,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:51:58,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:51:58,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (1/1) ... [2025-03-08 13:51:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:51:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:58,436 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-08 13:51:58,439 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-08 13:51:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:51:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:51:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:51:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:51:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:51:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:51:58,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:51:58,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:51:58,700 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:51:58,700 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:51:58,706 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:51:58,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:51:58,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:58 BoogieIcfgContainer [2025-03-08 13:51:58,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:51:58,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:51:58,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:51:58,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:51:58,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:51:58" (1/3) ... [2025-03-08 13:51:58,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eade966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:58, skipping insertion in model container [2025-03-08 13:51:58,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:58" (2/3) ... [2025-03-08 13:51:58,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eade966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:58, skipping insertion in model container [2025-03-08 13:51:58,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:58" (3/3) ... [2025-03-08 13:51:58,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2025-03-08 13:51:58,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:51:58,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-83.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:51:58,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:51:58,772 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;@d31e966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:51:58,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:51:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 13:51:58,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:58,780 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:58,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1648611234, now seen corresponding path program 1 times [2025-03-08 13:51:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:51:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745888416] [2025-03-08 13:51:58,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:58,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:51:58,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:58,793 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-08 13:51:58,795 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-08 13:51:58,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 13:51:58,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 13:51:58,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:58,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:51:58,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:51:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 13:51:58,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:51:58,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:51:58,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745888416] [2025-03-08 13:51:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745888416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:51:58,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:51:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:51:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325449098] [2025-03-08 13:51:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:51:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:51:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:51:58,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:51:58,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:51:58,949 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:51:58,967 INFO L93 Difference]: Finished difference Result 80 states and 132 transitions. [2025-03-08 13:51:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:51:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-03-08 13:51:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:51:58,972 INFO L225 Difference]: With dead ends: 80 [2025-03-08 13:51:58,972 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 13:51:58,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-08 13:51:58,976 INFO L435 NwaCegarLoop]: 56 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, 56 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-08 13:51:58,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:51:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 13:51:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 13:51:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:51:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-08 13:51:59,005 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 84 [2025-03-08 13:51:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:51:59,005 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-08 13:51:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:51:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-08 13:51:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 13:51:59,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:51:59,009 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:51:59,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:51:59,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:51:59,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:51:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:51:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1801043680, now seen corresponding path program 1 times [2025-03-08 13:51:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:51:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713629605] [2025-03-08 13:51:59,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:51:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:51:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:51:59,227 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-08 13:51:59,228 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-08 13:51:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 13:51:59,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 13:51:59,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:51:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:51:59,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 13:51:59,317 INFO L279 TraceCheckSpWp]: Computing forward predicates...