./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.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-38.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 c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:55:05,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:55:05,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:55:05,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:55:05,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:55:05,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:55:05,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:55:05,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:55:05,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:55:05,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:55:05,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:55:05,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:55:05,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:55:05,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:55:05,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:55:05,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:55:05,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:55:05,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:05,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:55:05,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:55:05,808 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 -> c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 [2025-03-16 22:55:06,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:55:06,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:55:06,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:55:06,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:55:06,033 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:55:06,034 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-38.i [2025-03-16 22:55:07,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb065b989/4e9c5da1fc7f47bab4325b94dfbdf150/FLAG91e63d483 [2025-03-16 22:55:07,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:55:07,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i [2025-03-16 22:55:07,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb065b989/4e9c5da1fc7f47bab4325b94dfbdf150/FLAG91e63d483 [2025-03-16 22:55:07,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb065b989/4e9c5da1fc7f47bab4325b94dfbdf150 [2025-03-16 22:55:07,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:55:07,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:55:07,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:07,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:55:07,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:55:07,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:07" (1/1) ... [2025-03-16 22:55:07,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357e2eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:07, skipping insertion in model container [2025-03-16 22:55:07,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:07" (1/1) ... [2025-03-16 22:55:07,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:55:07,863 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-38.i[919,932] [2025-03-16 22:55:07,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:07,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:55:07,925 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-38.i[919,932] [2025-03-16 22:55:07,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:07,971 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:55:07,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:07 WrapperNode [2025-03-16 22:55:07,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:07,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:07,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:55:07,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:55:07,978 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:07" (1/1) ... [2025-03-16 22:55:07,988 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:07" (1/1) ... [2025-03-16 22:55:08,014 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-03-16 22:55:08,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:08,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:55:08,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:55:08,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:55:08,028 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:07" (1/1) ... [2025-03-16 22:55:08,028 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:07" (1/1) ... [2025-03-16 22:55:08,030 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:07" (1/1) ... [2025-03-16 22:55:08,040 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:08,040 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:07" (1/1) ... [2025-03-16 22:55:08,040 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:07" (1/1) ... [2025-03-16 22:55:08,044 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:07" (1/1) ... [2025-03-16 22:55:08,045 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:07" (1/1) ... [2025-03-16 22:55:08,048 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:07" (1/1) ... [2025-03-16 22:55:08,049 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:07" (1/1) ... [2025-03-16 22:55:08,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:55:08,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:55:08,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:55:08,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:55:08,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:07" (1/1) ... [2025-03-16 22:55:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:08,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:08,083 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:08,085 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:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:55:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:55:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:55:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:55:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:55:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:55:08,165 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:55:08,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:55:08,395 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-16 22:55:08,419 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-16 22:55:08,419 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:55:08,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:55:08,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:55:08,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:08 BoogieIcfgContainer [2025-03-16 22:55:08,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:55:08,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:55:08,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:55:08,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:55:08,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:55:07" (1/3) ... [2025-03-16 22:55:08,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2523a99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:08, skipping insertion in model container [2025-03-16 22:55:08,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:07" (2/3) ... [2025-03-16 22:55:08,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2523a99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:55:08, skipping insertion in model container [2025-03-16 22:55:08,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:55:08" (3/3) ... [2025-03-16 22:55:08,436 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-38.i [2025-03-16 22:55:08,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:55:08,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-38.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:55:08,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:55:08,497 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;@74c7dd03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:55:08,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:55:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:55:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 22:55:08,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:08,512 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:08,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -852216115, now seen corresponding path program 1 times [2025-03-16 22:55:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592216019] [2025-03-16 22:55:08,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:08,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 22:55:08,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 22:55:08,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:08,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:55:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592216019] [2025-03-16 22:55:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592216019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:55:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752076245] [2025-03-16 22:55:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:55:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:09,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:55:09,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:55:09,211 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:09,473 INFO L93 Difference]: Finished difference Result 245 states and 452 transitions. [2025-03-16 22:55:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:55:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2025-03-16 22:55:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:09,485 INFO L225 Difference]: With dead ends: 245 [2025-03-16 22:55:09,485 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 22:55:09,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:55:09,492 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 197 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:09,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 372 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:55:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 22:55:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 123. [2025-03-16 22:55:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:55:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2025-03-16 22:55:09,570 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 137 [2025-03-16 22:55:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:09,572 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2025-03-16 22:55:09,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2025-03-16 22:55:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 22:55:09,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:09,574 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:09,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:55:09,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1021076638, now seen corresponding path program 1 times [2025-03-16 22:55:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098033808] [2025-03-16 22:55:09,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 22:55:09,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 22:55:09,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:09,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:55:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098033808] [2025-03-16 22:55:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098033808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:09,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:55:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329224337] [2025-03-16 22:55:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:55:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:55:09,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:55:09,884 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:10,114 INFO L93 Difference]: Finished difference Result 405 states and 629 transitions. [2025-03-16 22:55:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:55:10,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-16 22:55:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:10,118 INFO L225 Difference]: With dead ends: 405 [2025-03-16 22:55:10,119 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 22:55:10,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:55:10,122 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:10,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 331 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:55:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 22:55:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 245. [2025-03-16 22:55:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:55:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2025-03-16 22:55:10,170 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 138 [2025-03-16 22:55:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:10,171 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2025-03-16 22:55:10,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2025-03-16 22:55:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 22:55:10,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:10,174 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:10,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:55:10,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash 727673631, now seen corresponding path program 1 times [2025-03-16 22:55:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780019722] [2025-03-16 22:55:10,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 22:55:10,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 22:55:10,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:10,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 22:55:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780019722] [2025-03-16 22:55:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780019722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:55:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468076079] [2025-03-16 22:55:10,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:10,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:55:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:10,425 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:10,428 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:10,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 22:55:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 22:55:10,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:10,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:10,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 22:55:10,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 22:55:10,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:55:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 22:55:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468076079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:55:11,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:55:11,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-16 22:55:11,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457695793] [2025-03-16 22:55:11,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:55:11,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 22:55:11,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:11,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 22:55:11,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-16 22:55:11,137 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-16 22:55:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:11,723 INFO L93 Difference]: Finished difference Result 619 states and 952 transitions. [2025-03-16 22:55:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 22:55:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 138 [2025-03-16 22:55:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:11,727 INFO L225 Difference]: With dead ends: 619 [2025-03-16 22:55:11,727 INFO L226 Difference]: Without dead ends: 375 [2025-03-16 22:55:11,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2025-03-16 22:55:11,731 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 366 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 376 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:55:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-16 22:55:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 277. [2025-03-16 22:55:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 182 states have (on average 1.39010989010989) internal successors, (253), 182 states have internal predecessors, (253), 88 states have call successors, (88), 6 states have call predecessors, (88), 6 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:55:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 429 transitions. [2025-03-16 22:55:11,787 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 429 transitions. Word has length 138 [2025-03-16 22:55:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:11,788 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 429 transitions. [2025-03-16 22:55:11,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-16 22:55:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 429 transitions. [2025-03-16 22:55:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 22:55:11,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:11,792 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:11,799 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:11,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:55:11,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash 666658227, now seen corresponding path program 1 times [2025-03-16 22:55:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406330226] [2025-03-16 22:55:11,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 22:55:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 22:55:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:12,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:55:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627950722] [2025-03-16 22:55:12,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:12,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:55:12,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:12,035 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:12,036 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:12,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 22:55:12,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 22:55:12,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:12,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:55:12,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:55:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 22:55:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 22:55:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:55:12,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:55:12,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:55:12,275 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:55:12,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:55:12,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 22:55:12,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 22:55:12,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:55:12,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:55:12 BoogieIcfgContainer [2025-03-16 22:55:12,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:55:12,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:55:12,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:55:12,575 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:55:12,575 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:08" (3/4) ... [2025-03-16 22:55:12,577 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:55:12,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:55:12,578 INFO L158 Benchmark]: Toolchain (without parser) took 4831.37ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.9MB in the beginning and 161.1MB in the end (delta: -30.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:12,578 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 117.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.08ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: IcfgBuilder took 374.27ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: TraceAbstraction took 4142.82ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.7MB in the beginning and 161.1MB in the end (delta: -68.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-03-16 22:55:12,579 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 201.3MB. Free memory was 161.1MB in the beginning and 161.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:55:12,580 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 117.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.08ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.27ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4142.82ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.7MB in the beginning and 161.1MB in the end (delta: -68.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 201.3MB. Free memory was 161.1MB in the beginning and 161.1MB in the end (delta: 50.8kB). 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 shiftRight at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned short int last_1_var_1_8 = 4; [L41] signed short int last_1_var_1_21 = -64; [L42] signed char last_1_var_1_25 = -128; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_21 = var_1_21 [L124] last_1_var_1_25 = var_1_25 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L88] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L88] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L91] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L91] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L92] var_1_11 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L93] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L94] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L94] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L95] var_1_12 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L96] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L97] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L97] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L98] var_1_13 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L99] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L100] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L100] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L101] var_1_15 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L102] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L103] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L103] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L104] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L104] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L105] var_1_16 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L107] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L107] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L108] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L108] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L109] var_1_17 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L111] var_1_18 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L113] var_1_19 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L114] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L115] var_1_20 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L117] var_1_26 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L135] RET updateVariables() [L136] CALL step() [L46] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L46] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L47] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L51] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) [L56] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L58] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L65] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L67] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L68] COND TRUE \read(var_1_4) [L69] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L72] COND TRUE (- var_1_14) <= var_1_14 [L73] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L81] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L82] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L127-L128] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 123 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1079 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 795 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 284 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 194 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 829 NumberOfCodeBlocks, 829 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 2327 SizeOfPredicates, 2 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4539/4620 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:12,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.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 c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:55:14,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:55:14,498 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:14,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:55:14,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:55:14,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:55:14,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:55:14,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:55:14,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:55:14,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:55:14,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:55:14,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:55:14,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:55:14,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:55:14,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:55:14,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:55:14,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:55:14,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:55:14,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:14,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:55:14,534 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:55:14,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:55:14,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:55:14,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:55:14,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:55:14,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:55:14,535 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 -> c4c30cc1c9f61ef3217aaa58f1e66711cee3c800cceefbf6a14f505fd3f0aeb0 [2025-03-16 22:55:14,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:55:14,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:55:14,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:55:14,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:55:14,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:55:14,753 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-38.i [2025-03-16 22:55:15,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a5586a37/7befbbe254be4c2b8f8c42405abebe81/FLAG37918cee2 [2025-03-16 22:55:16,122 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:55:16,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-38.i [2025-03-16 22:55:16,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a5586a37/7befbbe254be4c2b8f8c42405abebe81/FLAG37918cee2 [2025-03-16 22:55:16,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a5586a37/7befbbe254be4c2b8f8c42405abebe81 [2025-03-16 22:55:16,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:55:16,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:55:16,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:16,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:55:16,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:55:16,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:16" (1/1) ... [2025-03-16 22:55:16,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da5fce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:16, skipping insertion in model container [2025-03-16 22:55:16,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:55:16" (1/1) ... [2025-03-16 22:55:16,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:55:16,266 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-38.i[919,932] [2025-03-16 22:55:16,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:16,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:55:16,345 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-38.i[919,932] [2025-03-16 22:55:16,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:55:16,390 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:55:16,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:16 WrapperNode [2025-03-16 22:55:16,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:55:16,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:16,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:55:16,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:55:16,398 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:16" (1/1) ... [2025-03-16 22:55:16,410 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:16" (1/1) ... [2025-03-16 22:55:16,428 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2025-03-16 22:55:16,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:55:16,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:55:16,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:55:16,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:55:16,435 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:16" (1/1) ... [2025-03-16 22:55:16,436 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:16" (1/1) ... [2025-03-16 22:55:16,441 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:16" (1/1) ... [2025-03-16 22:55:16,451 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:16,452 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:16" (1/1) ... [2025-03-16 22:55:16,452 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:16" (1/1) ... [2025-03-16 22:55:16,460 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:16" (1/1) ... [2025-03-16 22:55:16,462 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:16" (1/1) ... [2025-03-16 22:55:16,464 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:16" (1/1) ... [2025-03-16 22:55:16,466 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:16" (1/1) ... [2025-03-16 22:55:16,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:55:16,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:55:16,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:55:16,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:55:16,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:16" (1/1) ... [2025-03-16 22:55:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:55:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:55:16,495 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:16,497 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:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:55:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:55:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:55:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:55:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:55:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:55:16,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:55:16,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:55:21,144 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:55:21,144 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:55:21,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:55:21,151 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:55:21,151 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,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:55:21,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:55:21,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:55:21,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:55:21,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:55:16" (1/3) ... [2025-03-16 22:55:21,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0d0e56 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,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:55:16" (2/3) ... [2025-03-16 22:55:21,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0d0e56 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,157 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,158 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-38.i [2025-03-16 22:55:21,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:55:21,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-38.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:55:21,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:55:21,219 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;@7fbd4d3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:55:21,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:55:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:55:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 22:55:21,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:21,232 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:21,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:21,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash 687185861, now seen corresponding path program 1 times [2025-03-16 22:55:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074083021] [2025-03-16 22:55:21,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:21,247 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,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:21,249 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,250 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,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 22:55:21,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 22:55:21,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:21,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:21,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:55:21,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2025-03-16 22:55:21,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:55:21,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:55:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074083021] [2025-03-16 22:55:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074083021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:55:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741934092] [2025-03-16 22:55:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:55:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:55:21,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:55:21,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:55:21,689 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:55:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:21,703 INFO L93 Difference]: Finished difference Result 111 states and 200 transitions. [2025-03-16 22:55:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:55:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 133 [2025-03-16 22:55:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:21,708 INFO L225 Difference]: With dead ends: 111 [2025-03-16 22:55:21,708 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 22:55:21,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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:21,712 INFO L435 NwaCegarLoop]: 85 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, 85 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:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 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:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 22:55:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 22:55:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:55:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2025-03-16 22:55:21,743 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 133 [2025-03-16 22:55:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:21,743 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2025-03-16 22:55:21,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:55:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2025-03-16 22:55:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 22:55:21,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:21,746 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:21,760 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:21,947 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:21,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 139796928, now seen corresponding path program 1 times [2025-03-16 22:55:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:21,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396516462] [2025-03-16 22:55:21,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:21,949 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,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:21,990 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:21,991 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:22,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 22:55:22,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 22:55:22,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:22,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:22,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 22:55:22,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:55:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:55:23,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:55:23,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:55:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396516462] [2025-03-16 22:55:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396516462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:55:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160953033] [2025-03-16 22:55:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:55:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:55:23,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:55:23,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:55:23,531 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:27,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s 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:30,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:55:34,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s 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:36,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:55:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:36,549 INFO L93 Difference]: Finished difference Result 251 states and 386 transitions. [2025-03-16 22:55:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:55:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 133 [2025-03-16 22:55:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:36,554 INFO L225 Difference]: With dead ends: 251 [2025-03-16 22:55:36,554 INFO L226 Difference]: Without dead ends: 197 [2025-03-16 22:55:36,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:55:36,558 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 141 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 45 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:36,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 451 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2025-03-16 22:55:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-16 22:55:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2025-03-16 22:55:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:55:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2025-03-16 22:55:36,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 133 [2025-03-16 22:55:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2025-03-16 22:55:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:55:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2025-03-16 22:55:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:55:36,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:36,595 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:55:36,611 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:36,796 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:36,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -732370816, now seen corresponding path program 1 times [2025-03-16 22:55:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:55:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100848839] [2025-03-16 22:55:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:36,799 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:36,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:55:36,801 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:36,802 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:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:55:37,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:55:37,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:37,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:37,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 22:55:37,153 INFO L279 TraceCheckSpWp]: Computing forward predicates...