./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-36.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_codestructure_dependencies_file-36.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 ad1c196b4dc4b117caa72108eda377428c99ebe21f42ab32448b75350985ff78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:54:58,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:54:58,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:54:58,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:54:58,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:54:58,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:54:58,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:54:58,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:54:58,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:54:58,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:54:58,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:54:58,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:54:58,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:54:58,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:54:58,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:54:58,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:54:58,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:54:58,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:54:58,676 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 -> ad1c196b4dc4b117caa72108eda377428c99ebe21f42ab32448b75350985ff78 [2025-03-16 22:54:58,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:54:58,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:54:58,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:54:58,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:54:58,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:54:58,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:00,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4968c4f/78003bffd4a749099e6c5ca2b9461043/FLAG3ca6b8c7d [2025-03-16 22:55:00,345 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:55:00,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:00,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4968c4f/78003bffd4a749099e6c5ca2b9461043/FLAG3ca6b8c7d [2025-03-16 22:55:00,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4968c4f/78003bffd4a749099e6c5ca2b9461043 [2025-03-16 22:55:00,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:55:00,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:55:00,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:00,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:55:00,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:55:00,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00, skipping insertion in model container [2025-03-16 22:55:00,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:55:00,756 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_codestructure_dependencies_file-36.i[919,932] [2025-03-16 22:55:00,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:00,828 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:55:00,837 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_codestructure_dependencies_file-36.i[919,932] [2025-03-16 22:55:00,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:00,877 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:55:00,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00 WrapperNode [2025-03-16 22:55:00,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:00,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:00,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:55:00,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:55:00,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,905 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-03-16 22:55:00,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:00,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:55:00,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:55:00,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:55:00,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,927 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 22:55:00,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:55:00,939 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:55:00,939 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:55:00,939 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:55:00,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (1/1) ... [2025-03-16 22:55:00,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:00,962 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 22:55:00,964 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 22:55:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:55:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:55:00,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:55:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:55:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:55:00,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:55:01,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:55:01,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:55:01,270 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:55:01,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:55:01,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:55:01,281 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:55:01,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:01 BoogieIcfgContainer [2025-03-16 22:55:01,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:55:01,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:55:01,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:55:01,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:55:01,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:55:00" (1/3) ... [2025-03-16 22:55:01,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fa0344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:01, skipping insertion in model container [2025-03-16 22:55:01,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:00" (2/3) ... [2025-03-16 22:55:01,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fa0344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:01, skipping insertion in model container [2025-03-16 22:55:01,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:01" (3/3) ... [2025-03-16 22:55:01,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:01,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:55:01,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-36.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:55:01,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:55:01,349 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;@23645f1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:55:01,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:55:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:01,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:01,364 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:01,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1317619615, now seen corresponding path program 1 times [2025-03-16 22:55:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-16 22:55:01,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:01,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:01,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:01,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-16 22:55:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:01,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-16 22:55:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214559587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:55:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087772142] [2025-03-16 22:55:01,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:01,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:55:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:01,607 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 22:55:01,607 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 22:55:01,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:01,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:01,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:01,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:01,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:55:01,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-16 22:55:01,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:55:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087772142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:55:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:55:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998185862] [2025-03-16 22:55:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:55:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:55:01,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:55:01,792 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 22:55:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:01,807 INFO L93 Difference]: Finished difference Result 129 states and 228 transitions. [2025-03-16 22:55:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:55:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2025-03-16 22:55:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:01,814 INFO L225 Difference]: With dead ends: 129 [2025-03-16 22:55:01,814 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 22:55:01,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 22:55:01,817 INFO L435 NwaCegarLoop]: 99 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, 99 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 22:55:01,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:55:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 22:55:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 22:55:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2025-03-16 22:55:01,843 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 149 [2025-03-16 22:55:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:01,844 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2025-03-16 22:55:01,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 22:55:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2025-03-16 22:55:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:01,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:01,846 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:01,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:55:02,051 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 22:55:02,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:02,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1265839459, now seen corresponding path program 1 times [2025-03-16 22:55:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:02,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-16 22:55:02,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:02,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:02,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:02,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-16 22:55:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:02,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-16 22:55:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009933551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:55:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750428454] [2025-03-16 22:55:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:02,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:55:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:02,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:55:02,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:55:02,262 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-16 22:55:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:02,306 INFO L93 Difference]: Finished difference Result 145 states and 225 transitions. [2025-03-16 22:55:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:55:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2025-03-16 22:55:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:02,310 INFO L225 Difference]: With dead ends: 145 [2025-03-16 22:55:02,310 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 22:55:02,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:55:02,311 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:02,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 179 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:55:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 22:55:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2025-03-16 22:55:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2025-03-16 22:55:02,323 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 149 [2025-03-16 22:55:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-03-16 22:55:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-16 22:55:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2025-03-16 22:55:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:02,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:02,328 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:02,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:55:02,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1462352964, now seen corresponding path program 1 times [2025-03-16 22:55:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:02,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482512552] [2025-03-16 22:55:02,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:02,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:02,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:02,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:02,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:55:02,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543253786] [2025-03-16 22:55:02,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:02,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:55:02,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:02,477 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 22:55:02,478 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 22:55:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:02,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:02,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:02,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:55:02,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:55:02,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:02,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:02,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:02,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:55:02,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:55:02,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:55:02,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:55:02,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:55:02,880 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,SelfDestructingSolverStorable2 [2025-03-16 22:55:02,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 22:55:02,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:55:02,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:55:02 BoogieIcfgContainer [2025-03-16 22:55:02,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:55:02,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:55:02,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:55:02,971 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:55:02,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:01" (3/4) ... [2025-03-16 22:55:02,973 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:55:02,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:55:02,974 INFO L158 Benchmark]: Toolchain (without parser) took 2325.87ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 88.0MB in the end (delta: 67.0MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2025-03-16 22:55:02,974 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:02,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.07ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 140.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:55:02,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:02,975 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 133.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:02,975 INFO L158 Benchmark]: IcfgBuilder took 343.53ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 111.8MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:55:02,975 INFO L158 Benchmark]: TraceAbstraction took 1686.95ms. Allocated memory is still 201.3MB. Free memory was 111.2MB in the beginning and 89.0MB in the end (delta: 22.2MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-03-16 22:55:02,975 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 201.3MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:02,976 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.29ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.07ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 140.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 133.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.53ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 111.8MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1686.95ms. Allocated memory is still 201.3MB. Free memory was 111.2MB in the beginning and 89.0MB in the end (delta: 22.2MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 201.3MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). 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 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] unsigned short int var_1_24 = 16; [L45] unsigned char var_1_25 = 0; [L46] unsigned short int last_1_var_1_22 = 2; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L130] last_1_var_1_22 = var_1_22 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L93] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L98] var_1_6 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L99] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L103] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L104] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L104] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L106] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L107] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L107] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L108] var_1_11 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L110] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L110] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && 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_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L112] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && 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_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L113] var_1_18 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L114] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L115] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L115] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L116] var_1_19 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L117] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L118] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L118] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L120] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L121] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L121] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L123] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L124] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L124] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L125] var_1_25 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=65533] [L126] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=65533] [L127] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L127] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L141] RET updateVariables() [L142] CALL step() [L50] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=65533] [L53] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=65533, var_1_9=65533] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=65533, var_1_9=65533] [L57] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L58] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L65] COND TRUE var_1_3 <= var_1_4 [L66] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L68] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L77] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L79] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19) [L80] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=65534, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L82] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=65534, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=65534, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=2, var_1_10=65534, var_1_11=131072, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=65534, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=65533, var_1_9=65533] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 127 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 193 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3266/3312 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 22:55:02,991 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_codestructure_dependencies_file-36.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 ad1c196b4dc4b117caa72108eda377428c99ebe21f42ab32448b75350985ff78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:55:04,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:55:04,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:55:04,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:55:04,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:55:04,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:55:04,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:55:04,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:55:04,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:55:04,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:55:04,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:55:04,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:55:04,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:55:04,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:55:04,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:55:04,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:55:04,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:55:04,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:55:04,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:04,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:55:04,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:55:04,969 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 -> ad1c196b4dc4b117caa72108eda377428c99ebe21f42ab32448b75350985ff78 [2025-03-16 22:55:05,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:55:05,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:55:05,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:55:05,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:55:05,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:55:05,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:06,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb50f0cd4/6520077ae18f42028886bbffd535ed11/FLAG9ebef2526 [2025-03-16 22:55:06,594 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:55:06,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:06,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb50f0cd4/6520077ae18f42028886bbffd535ed11/FLAG9ebef2526 [2025-03-16 22:55:06,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb50f0cd4/6520077ae18f42028886bbffd535ed11 [2025-03-16 22:55:06,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:55:06,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:55:06,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:06,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:55:06,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:55:06,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de72cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06, skipping insertion in model container [2025-03-16 22:55:06,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:55:06,769 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_codestructure_dependencies_file-36.i[919,932] [2025-03-16 22:55:06,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:06,843 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:55:06,852 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_codestructure_dependencies_file-36.i[919,932] [2025-03-16 22:55:06,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:06,903 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:55:06,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06 WrapperNode [2025-03-16 22:55:06,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:06,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:06,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:55:06,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:55:06,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,952 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-16 22:55:06,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:06,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:55:06,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:55:06,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:55:06,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,984 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 22:55:06,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:06,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:07,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:07,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:07,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:07,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:55:07,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:55:07,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:55:07,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:55:07,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (1/1) ... [2025-03-16 22:55:07,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:07,047 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 22:55:07,051 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 22:55:07,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:55:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:55:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:55:07,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:55:07,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:55:07,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:55:07,136 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:55:07,138 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:55:21,627 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:55:21,628 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:55:21,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:55:21,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:55:21,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:21 BoogieIcfgContainer [2025-03-16 22:55:21,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:55:21,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:55:21,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:55:21,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:55:21,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:55:06" (1/3) ... [2025-03-16 22:55:21,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6b26d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:21, skipping insertion in model container [2025-03-16 22:55:21,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:06" (2/3) ... [2025-03-16 22:55:21,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6b26d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:21, skipping insertion in model container [2025-03-16 22:55:21,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:21" (3/3) ... [2025-03-16 22:55:21,645 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-36.i [2025-03-16 22:55:21,655 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:55:21,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-36.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:55:21,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:55:21,707 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;@7a320669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:55:21,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:55:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:21,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:21,718 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:21,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1317619615, now seen corresponding path program 1 times [2025-03-16 22:55:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098418420] [2025-03-16 22:55:21,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:21,732 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 22:55:21,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:21,734 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 22:55:21,735 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 22:55:21,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:22,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:22,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:22,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:22,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:55:22,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-16 22:55:22,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:55:22,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:55:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098418420] [2025-03-16 22:55:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098418420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:22,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:22,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:55:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801664717] [2025-03-16 22:55:22,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:22,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:55:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:55:22,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:55:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:55:22,806 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 22:55:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:22,824 INFO L93 Difference]: Finished difference Result 129 states and 228 transitions. [2025-03-16 22:55:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:55:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2025-03-16 22:55:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:22,830 INFO L225 Difference]: With dead ends: 129 [2025-03-16 22:55:22,830 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 22:55:22,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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 22:55:22,834 INFO L435 NwaCegarLoop]: 99 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, 99 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 22:55:22,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:55:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 22:55:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 22:55:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2025-03-16 22:55:22,866 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 149 [2025-03-16 22:55:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:22,866 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2025-03-16 22:55:22,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 22:55:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2025-03-16 22:55:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:22,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:22,870 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:22,900 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 22:55:23,071 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 22:55:23,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:23,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1265839459, now seen corresponding path program 1 times [2025-03-16 22:55:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90466972] [2025-03-16 22:55:23,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:23,073 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 22:55:23,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:23,075 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 22:55:23,076 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 22:55:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:23,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:23,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:23,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:24,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 22:55:24,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-16 22:55:24,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:55:24,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:55:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90466972] [2025-03-16 22:55:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90466972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:24,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:24,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:55:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391635791] [2025-03-16 22:55:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:55:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:55:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:55:24,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:55:24,145 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-16 22:55:29,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:55:33,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:55:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:34,032 INFO L93 Difference]: Finished difference Result 145 states and 225 transitions. [2025-03-16 22:55:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:55:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2025-03-16 22:55:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:34,034 INFO L225 Difference]: With dead ends: 145 [2025-03-16 22:55:34,034 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 22:55:34,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:55:34,036 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 23 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:34,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2025-03-16 22:55:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 22:55:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2025-03-16 22:55:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 22:55:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2025-03-16 22:55:34,044 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 149 [2025-03-16 22:55:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:34,044 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-03-16 22:55:34,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-16 22:55:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2025-03-16 22:55:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 22:55:34,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:34,049 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:34,076 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 (3)] Ended with exit code 0 [2025-03-16 22:55:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 22:55:34,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1462352964, now seen corresponding path program 1 times [2025-03-16 22:55:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865569464] [2025-03-16 22:55:34,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:34,250 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 22:55:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:34,252 INFO L229 MonitoredProcess]: Starting monitored process 4 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 22:55:34,253 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 (4)] Waiting until timeout for monitored process [2025-03-16 22:55:34,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 22:55:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 22:55:35,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:35,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:55:35,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:29,925 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 22:56:38,465 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)