./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:58:35,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:58:35,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:58:35,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:58:35,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:58:35,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:58:35,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:58:35,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:58:35,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:58:35,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:58:35,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:58:35,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:58:35,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:58:35,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:58:35,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:58:35,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:58:35,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:58:35,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:58:35,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:58:35,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:58:35,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:58:35,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:58:35,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:58:35,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:58:35,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:58:35,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:58:35,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:58:35,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:58:35,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:58:35,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:58:35,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:58:35,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:58:35,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:58:35,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:58:35,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:58:35,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:58:35,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:58:35,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:58:35,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:58:35,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:58:35,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:58:35,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:58:35,841 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-10-24 08:58:36,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:58:36,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:58:36,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:58:36,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:58:36,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:58:36,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:58:37,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:58:37,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:58:37,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:58:37,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c47decc1/33eaf0cb54214799ae54e3015b05dfd0/FLAG0c88c3151 [2024-10-24 08:58:38,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c47decc1/33eaf0cb54214799ae54e3015b05dfd0 [2024-10-24 08:58:38,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:58:38,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:58:38,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:58:38,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:58:38,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:58:38,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65870940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38, skipping insertion in model container [2024-10-24 08:58:38,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:58:38,354 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-24 08:58:38,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:58:38,431 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:58:38,442 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-24 08:58:38,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:58:38,499 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:58:38,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38 WrapperNode [2024-10-24 08:58:38,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:58:38,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:58:38,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:58:38,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:58:38,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,545 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-24 08:58:38,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:58:38,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:58:38,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:58:38,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:58:38,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,586 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]. [2024-10-24 08:58:38,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:58:38,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:58:38,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:58:38,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:58:38,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (1/1) ... [2024-10-24 08:58:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:58:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:58:38,657 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) [2024-10-24 08:58:38,661 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 [2024-10-24 08:58:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:58:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:58:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:58:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:58:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:58:38,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:58:38,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:58:38,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:58:39,096 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:58:39,096 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:58:39,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:58:39,135 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:58:39,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:58:39 BoogieIcfgContainer [2024-10-24 08:58:39,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:58:39,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:58:39,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:58:39,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:58:39,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:58:38" (1/3) ... [2024-10-24 08:58:39,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340afabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:58:39, skipping insertion in model container [2024-10-24 08:58:39,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:38" (2/3) ... [2024-10-24 08:58:39,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340afabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:58:39, skipping insertion in model container [2024-10-24 08:58:39,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:58:39" (3/3) ... [2024-10-24 08:58:39,146 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:58:39,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:58:39,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:58:39,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:58:39,218 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;@5943e0f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:58:39,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:58:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 08:58:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:58:39,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:58:39,239 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:58:39,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:58:39,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:58:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash -124053791, now seen corresponding path program 1 times [2024-10-24 08:58:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:58:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80068725] [2024-10-24 08:58:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:58:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:58:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:58:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:58:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:58:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:58:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:58:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:58:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:58:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:58:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:58:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:58:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:58:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:58:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:58:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:58:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:58:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:58:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:58:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:58:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 08:58:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:58:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 08:58:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:58:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 08:58:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 08:58:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:58:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80068725] [2024-10-24 08:58:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80068725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:58:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:58:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:58:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637941794] [2024-10-24 08:58:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:58:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:58:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:58:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:58:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:58:39,730 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 08:58:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:58:39,782 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2024-10-24 08:58:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:58:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2024-10-24 08:58:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:58:39,798 INFO L225 Difference]: With dead ends: 105 [2024-10-24 08:58:39,798 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 08:58:39,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:58:39,806 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:58:39,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:58:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 08:58:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 08:58:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 08:58:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-24 08:58:39,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2024-10-24 08:58:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:58:39,853 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-24 08:58:39,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 08:58:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-24 08:58:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:58:39,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:58:39,857 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:58:39,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:58:39,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:58:39,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:58:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1339576035, now seen corresponding path program 1 times [2024-10-24 08:58:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:58:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204894434] [2024-10-24 08:58:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:58:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:58:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:58:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:58:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:58:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:58:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:58:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:58:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:58:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:58:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:58:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:58:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:58:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:58:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:58:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:58:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:58:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:58:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:58:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:58:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 08:58:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:58:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 08:58:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:58:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 08:58:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:58:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 08:58:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:58:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204894434] [2024-10-24 08:58:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204894434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:58:50,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:58:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:58:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488440638] [2024-10-24 08:58:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:58:50,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:58:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:58:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:58:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:58:50,473 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 08:58:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:58:51,110 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2024-10-24 08:58:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:58:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-24 08:58:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:58:51,113 INFO L225 Difference]: With dead ends: 94 [2024-10-24 08:58:51,113 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 08:58:51,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:58:51,115 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:58:51,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 230 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:58:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 08:58:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2024-10-24 08:58:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 08:58:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2024-10-24 08:58:51,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 136 [2024-10-24 08:58:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:58:51,135 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2024-10-24 08:58:51,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 08:58:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2024-10-24 08:58:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:58:51,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:58:51,138 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:58:51,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:58:51,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:58:51,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:58:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2146044635, now seen corresponding path program 1 times [2024-10-24 08:58:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:58:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991660728] [2024-10-24 08:58:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:58:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:58:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:58:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016063747] [2024-10-24 08:58:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:58:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:58:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:58:51,231 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) [2024-10-24 08:58:51,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:58:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:58:51,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:58:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:58:51,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:58:51,472 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:58:51,473 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:58:51,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 08:58:51,674 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 [2024-10-24 08:58:51,678 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 08:58:51,759 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:58:51,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:58:51 BoogieIcfgContainer [2024-10-24 08:58:51,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:58:51,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:58:51,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:58:51,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:58:51,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:58:39" (3/4) ... [2024-10-24 08:58:51,765 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:58:51,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:58:51,767 INFO L158 Benchmark]: Toolchain (without parser) took 13621.70ms. Allocated memory was 125.8MB in the beginning and 526.4MB in the end (delta: 400.6MB). Free memory was 56.9MB in the beginning and 457.2MB in the end (delta: -400.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,767 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:58:51,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.23ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 56.6MB in the beginning and 127.8MB in the end (delta: -71.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.75ms. Allocated memory is still 157.3MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,769 INFO L158 Benchmark]: Boogie Preprocessor took 62.13ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,769 INFO L158 Benchmark]: RCFGBuilder took 528.45ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 99.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,769 INFO L158 Benchmark]: TraceAbstraction took 12622.57ms. Allocated memory was 157.3MB in the beginning and 526.4MB in the end (delta: 369.1MB). Free memory was 98.4MB in the beginning and 458.3MB in the end (delta: -359.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,770 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 526.4MB. Free memory was 458.3MB in the beginning and 457.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:58:51,773 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.16ms. Allocated memory is still 125.8MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.23ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 56.6MB in the beginning and 127.8MB in the end (delta: -71.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.75ms. Allocated memory is still 157.3MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.13ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 528.45ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 99.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12622.57ms. Allocated memory was 157.3MB in the beginning and 526.4MB in the end (delta: 369.1MB). Free memory was 98.4MB in the beginning and 458.3MB in the end (delta: -359.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 526.4MB. Free memory was 458.3MB in the beginning and 457.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 to_int at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] signed long int var_1_8 = 63; [L28] signed long int var_1_9 = 49; [L29] signed long int var_1_10 = 31; [L30] signed long int var_1_11 = 255; [L31] signed long int var_1_12 = 0; [L32] signed short int var_1_13 = -8; [L33] signed long int var_1_15 = 1000000000; [L34] unsigned short int var_1_16 = 4; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L68] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L70] var_1_5 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L73] var_1_6 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L74] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L75] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L75] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L76] var_1_7 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L99] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L40] COND FALSE !(var_1_7 > var_1_5) [L43] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L45] unsigned short int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-49152, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L46] COND FALSE !(stepLocal_0 <= var_1_5) [L51] var_1_13 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L53] COND FALSE !(var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) [L60] var_1_16 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L62] COND FALSE !(var_1_8 != var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_8 != var_1_8) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((signed long int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed long int) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)))))) && ((var_1_6 <= var_1_5) ? ((((((var_1_8) > ((var_1_12 / var_1_15))) ? (var_1_8) : ((var_1_12 / var_1_15)))) > ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))) ? (var_1_13 == ((signed short int) var_1_7)) : 1) : (var_1_13 == ((signed short int) var_1_7)))) && ((var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) ? ((var_1_17 || var_1_18) ? (var_1_16 == ((unsigned short int) var_1_4)) : (var_1_16 == ((unsigned short int) var_1_7))) : (var_1_16 == ((unsigned short int) var_1_6))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 154 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:58:51,806 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:58:54,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:58:54,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:58:54,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:58:54,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:58:54,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:58:54,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:58:54,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:58:54,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:58:54,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:58:54,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:58:54,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:58:54,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:58:54,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:58:54,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:58:54,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:58:54,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:58:54,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:58:54,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:58:54,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:58:54,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:58:54,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:58:54,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:58:54,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:58:54,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:58:54,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:58:54,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:58:54,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:58:54,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:58:54,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:58:54,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:58:54,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:58:54,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:58:54,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:58:54,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:58:54,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:58:54,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:58:54,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:58:54,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:58:54,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:58:54,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:58:54,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:58:54,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:58:54,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:58:54,147 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:58:54,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-10-24 08:58:54,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:58:54,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:58:54,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:58:54,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:58:54,492 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:58:54,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:58:55,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:58:56,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:58:56,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:58:56,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b291cc5e8/b39d71b394b7465dafe6dcaf450cebc5/FLAGb4d2a9a23 [2024-10-24 08:58:56,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b291cc5e8/b39d71b394b7465dafe6dcaf450cebc5 [2024-10-24 08:58:56,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:58:56,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:58:56,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:58:56,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:58:56,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:58:56,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429a3c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56, skipping insertion in model container [2024-10-24 08:58:56,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:58:56,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-24 08:58:56,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:58:56,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:58:56,527 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-24 08:58:56,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:58:56,575 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:58:56,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56 WrapperNode [2024-10-24 08:58:56,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:58:56,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:58:56,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:58:56,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:58:56,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,627 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-24 08:58:56,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:58:56,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:58:56,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:58:56,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:58:56,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,663 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]. [2024-10-24 08:58:56,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:58:56,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:58:56,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:58:56,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:58:56,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (1/1) ... [2024-10-24 08:58:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:58:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:58:56,719 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) [2024-10-24 08:58:56,725 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 [2024-10-24 08:58:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:58:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:58:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:58:56,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:58:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:58:56,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:58:56,843 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:58:56,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:59:02,853 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:59:02,854 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:59:02,913 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:59:02,915 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:59:02,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:02 BoogieIcfgContainer [2024-10-24 08:59:02,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:59:02,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:59:02,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:59:02,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:59:02,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:58:56" (1/3) ... [2024-10-24 08:59:02,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3574a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:02, skipping insertion in model container [2024-10-24 08:59:02,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:58:56" (2/3) ... [2024-10-24 08:59:02,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3574a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:02, skipping insertion in model container [2024-10-24 08:59:02,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:02" (3/3) ... [2024-10-24 08:59:02,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-24 08:59:02,940 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:59:02,941 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:59:03,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:59:03,012 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;@e4391d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:59:03,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:59:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 08:59:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:59:03,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:03,026 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:03,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -124053791, now seen corresponding path program 1 times [2024-10-24 08:59:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:59:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172843867] [2024-10-24 08:59:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:03,042 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 [2024-10-24 08:59:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:59:03,045 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) [2024-10-24 08:59:03,046 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 [2024-10-24 08:59:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:03,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:59:03,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:59:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-24 08:59:03,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:59:03,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:59:03,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172843867] [2024-10-24 08:59:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172843867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:59:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484791581] [2024-10-24 08:59:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:03,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:59:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:59:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:59:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:03,367 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 08:59:05,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:59:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:05,859 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2024-10-24 08:59:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:59:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2024-10-24 08:59:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:05,895 INFO L225 Difference]: With dead ends: 105 [2024-10-24 08:59:05,895 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 08:59:05,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:05,903 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:05,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 08:59:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 08:59:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 08:59:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 08:59:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-24 08:59:05,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2024-10-24 08:59:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:05,948 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-24 08:59:05,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 08:59:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-24 08:59:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:59:05,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:05,951 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:05,962 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 [2024-10-24 08:59:06,155 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 [2024-10-24 08:59:06,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:06,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1339576035, now seen corresponding path program 1 times [2024-10-24 08:59:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:59:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903355113] [2024-10-24 08:59:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:06,158 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 [2024-10-24 08:59:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:59:06,161 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) [2024-10-24 08:59:06,164 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 [2024-10-24 08:59:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:59:06,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:59:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:59:06,579 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 08:59:06,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044465835] [2024-10-24 08:59:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:06,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:59:06,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:59:06,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:59:06,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 08:59:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:07,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 08:59:07,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...