./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercode_fillercodesize_normal_file-16.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 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:28:11,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:28:11,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:28:11,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:28:11,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:28:11,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:28:11,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:28:11,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:28:11,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:28:11,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:28:11,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:28:11,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:28:11,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:28:11,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:28:11,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:28:11,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:28:11,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:28:11,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:11,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:28:11,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:28:11,962 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 -> 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 [2025-03-16 23:28:12,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:28:12,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:28:12,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:28:12,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:28:12,190 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:28:12,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:13,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d7f28df/2a43e93e477449b29a524aa9afc0dd7a/FLAGcf7e420c4 [2025-03-16 23:28:13,619 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:28:13,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:13,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d7f28df/2a43e93e477449b29a524aa9afc0dd7a/FLAGcf7e420c4 [2025-03-16 23:28:13,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d7f28df/2a43e93e477449b29a524aa9afc0dd7a [2025-03-16 23:28:13,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:28:13,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:28:13,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:13,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:28:13,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:28:13,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206a4507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13, skipping insertion in model container [2025-03-16 23:28:13,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:28:13,768 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_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-03-16 23:28:13,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:13,836 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:28:13,844 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_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-03-16 23:28:13,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:13,888 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:28:13,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13 WrapperNode [2025-03-16 23:28:13,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:13,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:13,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:28:13,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:28:13,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,927 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-16 23:28:13,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:13,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:28:13,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:28:13,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:28:13,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,944 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-16 23:28:13,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:28:13,955 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:28:13,955 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:28:13,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:28:13,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (1/1) ... [2025-03-16 23:28:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:13,978 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-16 23:28:13,980 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-16 23:28:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:28:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:28:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:28:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:28:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:28:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:28:14,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:28:14,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:28:14,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-16 23:28:14,290 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:28:14,290 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:28:14,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:28:14,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:28:14,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:14 BoogieIcfgContainer [2025-03-16 23:28:14,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:28:14,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:28:14,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:28:14,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:28:14,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:28:13" (1/3) ... [2025-03-16 23:28:14,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc50b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:14, skipping insertion in model container [2025-03-16 23:28:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:13" (2/3) ... [2025-03-16 23:28:14,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc50b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:14, skipping insertion in model container [2025-03-16 23:28:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:14" (3/3) ... [2025-03-16 23:28:14,312 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:14,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:28:14,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-16.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:28:14,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:28:14,376 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;@7b8b1df2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:28:14,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:28:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:14,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:14,390 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:14,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1100677347, now seen corresponding path program 1 times [2025-03-16 23:28:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734161862] [2025-03-16 23:28:14,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:14,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:14,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:14,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:28:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734161862] [2025-03-16 23:28:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734161862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:28:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487725746] [2025-03-16 23:28:14,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:14,675 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-16 23:28:14,677 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-16 23:28:14,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:14,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:14,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:28:14,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:28:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:28:14,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:28:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487725746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:28:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:28:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769380724] [2025-03-16 23:28:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:28:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:28:14,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:28:14,874 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:14,898 INFO L93 Difference]: Finished difference Result 143 states and 244 transitions. [2025-03-16 23:28:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:28:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-16 23:28:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:14,907 INFO L225 Difference]: With dead ends: 143 [2025-03-16 23:28:14,908 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 23:28:14,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-16 23:28:14,916 INFO L435 NwaCegarLoop]: 106 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, 106 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-16 23:28:14,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:28:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 23:28:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-16 23:28:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-03-16 23:28:14,983 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 144 [2025-03-16 23:28:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:14,984 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-03-16 23:28:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-03-16 23:28:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:14,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:14,986 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:14,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:28:15,187 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-16 23:28:15,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:15,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2104687297, now seen corresponding path program 1 times [2025-03-16 23:28:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876830311] [2025-03-16 23:28:15,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:15,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:15,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:15,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:15,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876830311] [2025-03-16 23:28:15,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876830311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:15,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:15,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:28:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882524755] [2025-03-16 23:28:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:15,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:28:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:15,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:28:15,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:28:15,609 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:15,778 INFO L93 Difference]: Finished difference Result 246 states and 362 transitions. [2025-03-16 23:28:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:28:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:15,781 INFO L225 Difference]: With dead ends: 246 [2025-03-16 23:28:15,781 INFO L226 Difference]: Without dead ends: 176 [2025-03-16 23:28:15,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:28:15,788 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 185 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:15,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 344 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:28:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-16 23:28:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2025-03-16 23:28:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 23:28:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-03-16 23:28:15,801 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 185 transitions. Word has length 144 [2025-03-16 23:28:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-03-16 23:28:15,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 185 transitions. [2025-03-16 23:28:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:15,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:15,804 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:28:15,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -836970302, now seen corresponding path program 1 times [2025-03-16 23:28:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845955126] [2025-03-16 23:28:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:15,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845955126] [2025-03-16 23:28:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845955126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 23:28:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426050562] [2025-03-16 23:28:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 23:28:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:16,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 23:28:16,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:28:16,049 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:16,206 INFO L93 Difference]: Finished difference Result 318 states and 468 transitions. [2025-03-16 23:28:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 23:28:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:16,208 INFO L225 Difference]: With dead ends: 318 [2025-03-16 23:28:16,208 INFO L226 Difference]: Without dead ends: 197 [2025-03-16 23:28:16,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:28:16,210 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 211 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:16,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 530 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:28:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-16 23:28:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2025-03-16 23:28:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 143 states have internal predecessors, (203), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 23:28:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2025-03-16 23:28:16,235 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 144 [2025-03-16 23:28:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:16,237 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 259 transitions. [2025-03-16 23:28:16,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 259 transitions. [2025-03-16 23:28:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:16,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:16,242 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:28:16,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:16,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash -707887583, now seen corresponding path program 1 times [2025-03-16 23:28:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147215085] [2025-03-16 23:28:16,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:16,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147215085] [2025-03-16 23:28:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147215085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:17,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:17,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:28:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352891303] [2025-03-16 23:28:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:17,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:28:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:17,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:28:17,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:28:17,051 INFO L87 Difference]: Start difference. First operand 174 states and 259 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:17,309 INFO L93 Difference]: Finished difference Result 518 states and 772 transitions. [2025-03-16 23:28:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:28:17,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:17,312 INFO L225 Difference]: With dead ends: 518 [2025-03-16 23:28:17,312 INFO L226 Difference]: Without dead ends: 345 [2025-03-16 23:28:17,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:28:17,313 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 111 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:17,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 695 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:28:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-16 23:28:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 249. [2025-03-16 23:28:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 218 states have internal predecessors, (321), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 23:28:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 377 transitions. [2025-03-16 23:28:17,335 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 377 transitions. Word has length 144 [2025-03-16 23:28:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 377 transitions. [2025-03-16 23:28:17,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 377 transitions. [2025-03-16 23:28:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:17,340 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:28:17,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1107614944, now seen corresponding path program 1 times [2025-03-16 23:28:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976963092] [2025-03-16 23:28:17,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:17,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976963092] [2025-03-16 23:28:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976963092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:18,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:28:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858066041] [2025-03-16 23:28:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:18,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:28:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:18,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:28:18,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:28:18,095 INFO L87 Difference]: Start difference. First operand 249 states and 377 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:18,383 INFO L93 Difference]: Finished difference Result 589 states and 883 transitions. [2025-03-16 23:28:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 23:28:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:18,387 INFO L225 Difference]: With dead ends: 589 [2025-03-16 23:28:18,387 INFO L226 Difference]: Without dead ends: 341 [2025-03-16 23:28:18,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:28:18,388 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 101 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:18,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 627 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:28:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-16 23:28:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2025-03-16 23:28:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 250 states have (on average 1.484) internal successors, (371), 252 states have internal predecessors, (371), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 23:28:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 427 transitions. [2025-03-16 23:28:18,422 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 427 transitions. Word has length 144 [2025-03-16 23:28:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:18,422 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 427 transitions. [2025-03-16 23:28:18,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2025-03-16 23:28:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:18,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:18,424 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:28:18,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1236697663, now seen corresponding path program 1 times [2025-03-16 23:28:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828522962] [2025-03-16 23:28:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:18,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:18,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:18,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828522962] [2025-03-16 23:28:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828522962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:28:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89506620] [2025-03-16 23:28:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:18,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:28:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:28:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:28:18,978 INFO L87 Difference]: Start difference. First operand 283 states and 427 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:19,246 INFO L93 Difference]: Finished difference Result 623 states and 927 transitions. [2025-03-16 23:28:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 23:28:19,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:19,248 INFO L225 Difference]: With dead ends: 623 [2025-03-16 23:28:19,248 INFO L226 Difference]: Without dead ends: 341 [2025-03-16 23:28:19,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:28:19,249 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 88 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:19,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 727 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:28:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-16 23:28:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 267. [2025-03-16 23:28:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 234 states have (on average 1.4743589743589745) internal successors, (345), 236 states have internal predecessors, (345), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 23:28:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 401 transitions. [2025-03-16 23:28:19,269 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 401 transitions. Word has length 144 [2025-03-16 23:28:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 401 transitions. [2025-03-16 23:28:19,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 401 transitions. [2025-03-16 23:28:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:28:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:19,280 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:28:19,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1834042655, now seen corresponding path program 1 times [2025-03-16 23:28:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140563440] [2025-03-16 23:28:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:19,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:28:19,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:28:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140563440] [2025-03-16 23:28:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140563440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:28:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386416929] [2025-03-16 23:28:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:28:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:19,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:28:19,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:28:19,909 INFO L87 Difference]: Start difference. First operand 267 states and 401 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:20,164 INFO L93 Difference]: Finished difference Result 613 states and 908 transitions. [2025-03-16 23:28:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 23:28:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:28:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:20,166 INFO L225 Difference]: With dead ends: 613 [2025-03-16 23:28:20,166 INFO L226 Difference]: Without dead ends: 347 [2025-03-16 23:28:20,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:28:20,167 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:20,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 799 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:28:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-16 23:28:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 266. [2025-03-16 23:28:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 233 states have (on average 1.4721030042918455) internal successors, (343), 235 states have internal predecessors, (343), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 23:28:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2025-03-16 23:28:20,190 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 144 [2025-03-16 23:28:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:20,190 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2025-03-16 23:28:20,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2025-03-16 23:28:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:28:20,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:20,195 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:28:20,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1990716908, now seen corresponding path program 1 times [2025-03-16 23:28:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455865110] [2025-03-16 23:28:20,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:20,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:20,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:28:20,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:28:20,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:20,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:20,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455865110] [2025-03-16 23:28:20,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455865110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:20,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:20,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:28:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349495156] [2025-03-16 23:28:20,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:20,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:28:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:20,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:28:20,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:28:20,369 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:20,511 INFO L93 Difference]: Finished difference Result 787 states and 1166 transitions. [2025-03-16 23:28:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:28:20,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-16 23:28:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:20,516 INFO L225 Difference]: With dead ends: 787 [2025-03-16 23:28:20,516 INFO L226 Difference]: Without dead ends: 522 [2025-03-16 23:28:20,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:28:20,520 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 103 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:20,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 408 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:28:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-16 23:28:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 437. [2025-03-16 23:28:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 372 states have (on average 1.4408602150537635) internal successors, (536), 376 states have internal predecessors, (536), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-16 23:28:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 648 transitions. [2025-03-16 23:28:20,552 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 648 transitions. Word has length 145 [2025-03-16 23:28:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 648 transitions. [2025-03-16 23:28:20,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 648 transitions. [2025-03-16 23:28:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:28:20,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:20,556 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:20,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:28:20,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1793433471, now seen corresponding path program 1 times [2025-03-16 23:28:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313160482] [2025-03-16 23:28:20,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:20,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:28:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:28:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:28:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313160482] [2025-03-16 23:28:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313160482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:28:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591437455] [2025-03-16 23:28:20,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:20,749 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-16 23:28:20,750 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-16 23:28:20,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:28:20,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:28:20,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:20,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:20,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 23:28:20,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:28:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-16 23:28:20,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:28:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:28:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591437455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:28:21,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:28:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-16 23:28:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623491120] [2025-03-16 23:28:21,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:28:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:28:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:21,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:28:21,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:28:21,153 INFO L87 Difference]: Start difference. First operand 437 states and 648 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:28:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:21,619 INFO L93 Difference]: Finished difference Result 983 states and 1430 transitions. [2025-03-16 23:28:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 23:28:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 146 [2025-03-16 23:28:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:21,622 INFO L225 Difference]: With dead ends: 983 [2025-03-16 23:28:21,622 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 23:28:21,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2025-03-16 23:28:21,625 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 477 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:21,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 411 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:28:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 23:28:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 310. [2025-03-16 23:28:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 257 states have (on average 1.4357976653696498) internal successors, (369), 258 states have internal predecessors, (369), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 23:28:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 461 transitions. [2025-03-16 23:28:21,651 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 461 transitions. Word has length 146 [2025-03-16 23:28:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:21,651 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 461 transitions. [2025-03-16 23:28:21,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:28:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 461 transitions. [2025-03-16 23:28:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:28:21,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:21,653 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:21,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:28:21,853 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,SelfDestructingSolverStorable8 [2025-03-16 23:28:21,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1560327554, now seen corresponding path program 1 times [2025-03-16 23:28:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587505483] [2025-03-16 23:28:21,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:21,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:28:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:28:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:28:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117793150] [2025-03-16 23:28:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:21,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:28:21,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:28:21,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:28:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:28:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:28:22,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:28:22,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:28:22,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:28:22,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:22,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:28:22,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:28:22,193 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:28:22,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:28:22,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 23:28:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:22,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:28:22,478 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:28:22,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:28:22 BoogieIcfgContainer [2025-03-16 23:28:22,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:28:22,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:28:22,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:28:22,481 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:28:22,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:14" (3/4) ... [2025-03-16 23:28:22,483 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:28:22,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:28:22,484 INFO L158 Benchmark]: Toolchain (without parser) took 8835.72ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 133.1MB in the beginning and 240.5MB in the end (delta: -107.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2025-03-16 23:28:22,484 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.12ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 119.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 116.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: Boogie Preprocessor took 27.24ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 113.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: IcfgBuilder took 349.77ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 91.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: TraceAbstraction took 8173.44ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 91.0MB in the beginning and 240.6MB in the end (delta: -149.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-03-16 23:28:22,485 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 327.2MB. Free memory was 240.6MB in the beginning and 240.5MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:22,486 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.12ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 119.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 116.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.24ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 113.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 349.77ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 91.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8173.44ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 91.0MB in the beginning and 240.6MB in the end (delta: -149.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 327.2MB. Free memory was 240.6MB in the beginning and 240.5MB in the end (delta: 101.6kB). 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 someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someUnaryFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned short int last_1_var_1_7 = 8; [L44] unsigned short int last_1_var_1_11 = 32; [L45] signed char last_1_var_1_14 = 32; [L46] unsigned short int last_1_var_1_23 = 128; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_11 = var_1_11 [L135] last_1_var_1_14 = var_1_14 [L136] last_1_var_1_23 = var_1_23 [L146] RET updateLastVariables() [L147] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] var_1_5 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] var_1_6 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=256, var_1_9=2] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L107] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L108] var_1_10 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L109] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L110] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L115] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L115] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L119] var_1_17 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L120] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L121] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L126] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L128] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L129] var_1_22 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L130] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_0=32, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L51] COND FALSE !((last_1_var_1_23 / -50) >= stepLocal_0) [L58] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L60] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=2] [L63] COND TRUE var_1_6 > 128 [L64] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=-1073709059] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=-1073709059] [L66] signed long int stepLocal_2 = var_1_5 | var_1_6; [L67] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < stepLocal_2) [L72] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=-1073709059] [L74] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_1=32766, var_1_10=1073741826, var_1_11=32767, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=8, var_1_8=32767, var_1_9=-1073709059] [L75] COND TRUE last_1_var_1_7 < stepLocal_1 [L76] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L78] unsigned short int stepLocal_4 = var_1_8; [L79] signed long int stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_3=-1073709059, stepLocal_4=32767, var_1_10=1073741826, var_1_11=32767, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L80] COND FALSE !(stepLocal_3 < (- var_1_10)) [L85] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32767, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L87] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32767, stepLocal_5=32767, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L88] COND TRUE last_1_var_1_14 <= stepLocal_5 [L89] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32767, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L91] COND TRUE var_1_4 || var_1_19 [L92] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=32767, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L139-L140] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741826, var_1_11=32767, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=32766, var_1_7=65533, var_1_8=32767, var_1_9=-1073709059] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 134 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1392 mSDsluCounter, 4647 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3624 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2034 IncrementalHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 1023 mSDtfsCounter, 2034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 458 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=8, InterpolantAutomatonStates: 76, 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, 9 MinimizatonAttempts, 711 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1723 ConstructedInterpolants, 0 QuantifiedInterpolants, 4235 SizeOfPredicates, 4 NumberOfNonLiveVariables, 704 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 10893/11088 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-16 23:28:22,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_fillercode_fillercodesize_normal_file-16.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 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:28:24,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:28:24,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:28:24,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:28:24,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:28:24,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:28:24,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:28:24,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:28:24,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:28:24,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:28:24,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:28:24,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:28:24,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:28:24,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:28:24,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:28:24,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:28:24,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:28:24,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:28:24,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:28:24,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:28:24,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:28:24,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:28:24,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:28:24,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:24,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:28:24,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:28:24,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:28:24,431 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 -> 53b80b500f1c3e6ef66692aede3d66b913959846a370626499a84b69a5b8c202 [2025-03-16 23:28:24,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:28:24,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:28:24,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:28:24,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:28:24,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:28:24,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:25,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d589658/b300e1e7200e428d884708f6006850fa/FLAGb1fdb0766 [2025-03-16 23:28:26,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:28:26,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:26,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d589658/b300e1e7200e428d884708f6006850fa/FLAGb1fdb0766 [2025-03-16 23:28:26,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d589658/b300e1e7200e428d884708f6006850fa [2025-03-16 23:28:26,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:28:26,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:28:26,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:26,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:28:26,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:28:26,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69950f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26, skipping insertion in model container [2025-03-16 23:28:26,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:28:26,554 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_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-03-16 23:28:26,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:26,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:28:26,615 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_fillercode_fillercodesize_normal_file-16.i[913,926] [2025-03-16 23:28:26,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:26,645 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:28:26,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26 WrapperNode [2025-03-16 23:28:26,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:26,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:26,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:28:26,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:28:26,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,678 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-16 23:28:26,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:26,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:28:26,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:28:26,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:28:26,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,698 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-16 23:28:26,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:28:26,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:28:26,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:28:26,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:28:26,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (1/1) ... [2025-03-16 23:28:26,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:26,737 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-16 23:28:26,740 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-16 23:28:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:28:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:28:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:28:26,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:28:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:28:26,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:28:26,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:28:26,827 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:28:28,244 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-16 23:28:28,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:28:28,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:28:28,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:28:28,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:28 BoogieIcfgContainer [2025-03-16 23:28:28,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:28:28,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:28:28,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:28:28,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:28:28,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:28:26" (1/3) ... [2025-03-16 23:28:28,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7780ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:28, skipping insertion in model container [2025-03-16 23:28:28,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:26" (2/3) ... [2025-03-16 23:28:28,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7780ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:28, skipping insertion in model container [2025-03-16 23:28:28,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:28" (3/3) ... [2025-03-16 23:28:28,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-16.i [2025-03-16 23:28:28,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:28:28,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-16.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:28:28,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:28:28,321 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;@2891fc58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:28:28,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:28:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 23:28:28,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:28,333 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:28,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1769261634, now seen corresponding path program 1 times [2025-03-16 23:28:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:28:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555219805] [2025-03-16 23:28:28,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:28,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:28:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:28:28,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:28:28,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 23:28:28,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 23:28:28,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 23:28:28,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:28,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:28,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:28:28,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:28:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-16 23:28:28,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:28:28,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:28:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555219805] [2025-03-16 23:28:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555219805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:28,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:28:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063492789] [2025-03-16 23:28:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:28:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:28:28,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:28:28,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:28:28,704 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:28,724 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2025-03-16 23:28:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:28:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2025-03-16 23:28:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:28,732 INFO L225 Difference]: With dead ends: 123 [2025-03-16 23:28:28,733 INFO L226 Difference]: Without dead ends: 61 [2025-03-16 23:28:28,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-16 23:28:28,738 INFO L435 NwaCegarLoop]: 93 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, 93 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-16 23:28:28,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:28:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-16 23:28:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-16 23:28:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-16 23:28:28,773 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 140 [2025-03-16 23:28:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-16 23:28:28,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-16 23:28:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 23:28:28,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:28,777 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:28,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:28:28,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:28:28,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:28,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash -369477658, now seen corresponding path program 1 times [2025-03-16 23:28:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:28:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763171743] [2025-03-16 23:28:28,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:28:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:28:28,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:28:28,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 23:28:29,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 23:28:29,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 23:28:29,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:29,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:29,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 23:28:29,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:29:07,860 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)