./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.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 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:52:50,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:52:51,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:52:51,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:52:51,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:52:51,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:52:51,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:52:51,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:52:51,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:52:51,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:52:51,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:52:51,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:52:51,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:52:51,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:52:51,045 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:52:51,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:52:51,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:52:51,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:52:51,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:52:51,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:52:51,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:52:51,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:52:51,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:52:51,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:52:51,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:52:51,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:52:51,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:52:51,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:52:51,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:52:51,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:52:51,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:52:51,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:52:51,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:52:51,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:52:51,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:52:51,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:52:51,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:52:51,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:52:51,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:52:51,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:52:51,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:52:51,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:52:51,057 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 -> 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 [2024-11-10 06:52:51,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:52:51,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:52:51,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:52:51,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:52:51,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:52:51,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:52:52,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:52:52,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:52:52,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:52:52,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6560c25/bda2bffa6cfc423e90d7b8bdba9a3def/FLAGaa9694b91 [2024-11-10 06:52:52,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6560c25/bda2bffa6cfc423e90d7b8bdba9a3def [2024-11-10 06:52:52,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:52:52,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:52:52,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:52:52,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:52:52,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:52:52,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:52" (1/1) ... [2024-11-10 06:52:52,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5b4ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:52, skipping insertion in model container [2024-11-10 06:52:52,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:52" (1/1) ... [2024-11-10 06:52:52,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:52:52,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i[916,929] [2024-11-10 06:52:52,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:52:52,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:52:52,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i[916,929] [2024-11-10 06:52:52,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:52:53,008 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:52:53,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53 WrapperNode [2024-11-10 06:52:53,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:52:53,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:52:53,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:52:53,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:52:53,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,057 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-10 06:52:53,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:52:53,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:52:53,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:52:53,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:52:53,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,091 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-11-10 06:52:53,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:52:53,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:52:53,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:52:53,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:52:53,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (1/1) ... [2024-11-10 06:52:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:52:53,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:52:53,138 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-11-10 06:52:53,140 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-11-10 06:52:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:52:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:52:53,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:52:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:52:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:52:53,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:52:53,297 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:52:53,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:52:53,510 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2024-11-10 06:52:53,537 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:52:53,537 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:52:53,558 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:52:53,559 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:52:53,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:53 BoogieIcfgContainer [2024-11-10 06:52:53,559 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:52:53,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:52:53,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:52:53,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:52:53,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:52:52" (1/3) ... [2024-11-10 06:52:53,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f759503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:53, skipping insertion in model container [2024-11-10 06:52:53,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:53" (2/3) ... [2024-11-10 06:52:53,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f759503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:53, skipping insertion in model container [2024-11-10 06:52:53,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:53" (3/3) ... [2024-11-10 06:52:53,566 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:52:53,580 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:52:53,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:52:53,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:52:53,634 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;@1c2f5a3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:52:53,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:52:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:52:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:52:53,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:52:53,648 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:52:53,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:52:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:52:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -309004863, now seen corresponding path program 1 times [2024-11-10 06:52:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:52:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374323802] [2024-11-10 06:52:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:52:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:52:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:52:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:52:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:52:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:52:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:52:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:52:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:52:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:52:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:52:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 06:52:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:52:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 06:52:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:52:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 06:52:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:52:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:52:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:52:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 06:52:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 06:52:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 06:52:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:52:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:52:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374323802] [2024-11-10 06:52:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374323802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:52:53,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:52:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:52:53,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975787873] [2024-11-10 06:52:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:52:53,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:52:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:52:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:52:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:52:53,977 INFO L87 Difference]: Start difference. First operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:52:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:52:54,006 INFO L93 Difference]: Finished difference Result 128 states and 217 transitions. [2024-11-10 06:52:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:52:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-11-10 06:52:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:52:54,014 INFO L225 Difference]: With dead ends: 128 [2024-11-10 06:52:54,014 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 06:52:54,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11-10 06:52:54,021 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:52:54,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:52:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 06:52:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-10 06:52:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:52:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-11-10 06:52:54,064 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 128 [2024-11-10 06:52:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:52:54,064 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-11-10 06:52:54,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:52:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-11-10 06:52:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:52:54,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:52:54,067 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:52:54,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:52:54,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:52:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:52:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -480356513, now seen corresponding path program 1 times [2024-11-10 06:52:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:52:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858591982] [2024-11-10 06:52:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:52:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:52:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:52:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:52:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:52:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:52:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:52:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:52:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:52:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:52:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:52:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 06:52:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:52:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 06:52:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:52:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 06:52:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:52:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:52:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:52:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 06:52:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 06:52:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 06:52:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:52:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:52:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:52:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858591982] [2024-11-10 06:52:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858591982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:52:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:52:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 06:52:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476837922] [2024-11-10 06:52:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:52:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 06:52:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:52:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 06:52:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:52:54,554 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:52:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:52:54,636 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2024-11-10 06:52:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:52:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-11-10 06:52:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:52:54,639 INFO L225 Difference]: With dead ends: 144 [2024-11-10 06:52:54,639 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 06:52:54,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:52:54,640 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 25 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:52:54,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 449 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:52:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 06:52:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2024-11-10 06:52:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:52:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2024-11-10 06:52:54,649 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 128 [2024-11-10 06:52:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:52:54,651 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2024-11-10 06:52:54,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 06:52:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-11-10 06:52:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 06:52:54,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:52:54,652 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:52:54,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:52:54,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:52:54,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:52:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1543989620, now seen corresponding path program 1 times [2024-11-10 06:52:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:52:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808933719] [2024-11-10 06:52:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:52:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:52:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:52:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33536910] [2024-11-10 06:52:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:52:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:52:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:52:54,723 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-11-10 06:52:54,724 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-11-10 06:52:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:52:54,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:52:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:52:54,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:52:54,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:52:54,914 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:52:54,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:52:55,117 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-11-10 06:52:55,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:52:55,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:52:55,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:52:55 BoogieIcfgContainer [2024-11-10 06:52:55,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:52:55,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:52:55,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:52:55,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:52:55,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:53" (3/4) ... [2024-11-10 06:52:55,200 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:52:55,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:52:55,201 INFO L158 Benchmark]: Toolchain (without parser) took 2458.66ms. Allocated memory is still 186.6MB. Free memory was 115.4MB in the beginning and 66.4MB in the end (delta: 49.0MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,201 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:52:55,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 186.6MB. Free memory was 115.2MB in the beginning and 100.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.11ms. Allocated memory is still 186.6MB. Free memory was 100.9MB in the beginning and 98.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,202 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 186.6MB. Free memory was 98.4MB in the beginning and 95.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,202 INFO L158 Benchmark]: IcfgBuilder took 454.30ms. Allocated memory is still 186.6MB. Free memory was 95.4MB in the beginning and 139.1MB in the end (delta: -43.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,203 INFO L158 Benchmark]: TraceAbstraction took 1635.42ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 66.4MB in the end (delta: 72.7MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2024-11-10 06:52:55,203 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 186.6MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:52:55,207 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 186.6MB. Free memory was 115.2MB in the beginning and 100.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.11ms. Allocated memory is still 186.6MB. Free memory was 100.9MB in the beginning and 98.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 186.6MB. Free memory was 98.4MB in the beginning and 95.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 454.30ms. Allocated memory is still 186.6MB. Free memory was 95.4MB in the beginning and 139.1MB in the end (delta: -43.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1635.42ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 66.4MB in the end (delta: 72.7MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 186.6MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] signed long int var_1_13 = 8; [L31] signed long int var_1_15 = 49; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] signed long int var_1_19 = 7; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] signed long int last_1_var_1_13 = 8; VAL [isInitial=0, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L87] var_1_15 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L88] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L89] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L89] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L90] var_1_17 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L91] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L92] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L92] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L94] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L95] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L95] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L109] RET updateVariables() [L110] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-3, var_1_9=3] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-3, var_1_9=3] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-3, var_1_9=3] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-3, var_1_9=3] [L101-L102] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((signed long int) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((signed long int) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=0, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-3, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=0, var_1_15=9, var_1_16=-3, var_1_17=-3, var_1_18=-3, var_1_19=9, var_1_1=-4, var_1_20=-3, var_1_21=-3, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-3, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 187 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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-11-10 06:52:55,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.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 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:52:57,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:52:57,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:52:57,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:52:57,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:52:57,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:52:57,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:52:57,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:52:57,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:52:57,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:52:57,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:52:57,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:52:57,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:52:57,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:52:57,114 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:52:57,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:52:57,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:52:57,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:52:57,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:52:57,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:52:57,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:52:57,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:52:57,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:52:57,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:52:57,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:52:57,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:52:57,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:52:57,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:52:57,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:52:57,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:52:57,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:52:57,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:52:57,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:52:57,120 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 -> 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 [2024-11-10 06:52:57,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:52:57,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:52:57,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:52:57,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:52:57,370 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:52:57,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:52:58,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:52:58,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:52:58,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:52:58,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e0c3b4a/5719843a28c14023accdeee88c694170/FLAG493cd38a1 [2024-11-10 06:52:58,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e0c3b4a/5719843a28c14023accdeee88c694170 [2024-11-10 06:52:58,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:52:58,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:52:58,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:52:58,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:52:58,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:52:58,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:58" (1/1) ... [2024-11-10 06:52:58,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8554fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:58, skipping insertion in model container [2024-11-10 06:52:58,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:58" (1/1) ... [2024-11-10 06:52:58,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:52:59,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i[916,929] [2024-11-10 06:52:59,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:52:59,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:52:59,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i[916,929] [2024-11-10 06:52:59,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:52:59,161 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:52:59,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59 WrapperNode [2024-11-10 06:52:59,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:52:59,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:52:59,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:52:59,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:52:59,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,195 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-10 06:52:59,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:52:59,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:52:59,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:52:59,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:52:59,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,220 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-11-10 06:52:59,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:52:59,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:52:59,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:52:59,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:52:59,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (1/1) ... [2024-11-10 06:52:59,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:52:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:52:59,279 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-11-10 06:52:59,281 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-11-10 06:52:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:52:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:52:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:52:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:52:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:52:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:52:59,374 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:52:59,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:53:04,239 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 06:53:04,239 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:53:04,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:53:04,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:53:04,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:53:04 BoogieIcfgContainer [2024-11-10 06:53:04,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:53:04,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:53:04,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:53:04,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:53:04,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:52:58" (1/3) ... [2024-11-10 06:53:04,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a777f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:53:04, skipping insertion in model container [2024-11-10 06:53:04,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:59" (2/3) ... [2024-11-10 06:53:04,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a777f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:53:04, skipping insertion in model container [2024-11-10 06:53:04,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:53:04" (3/3) ... [2024-11-10 06:53:04,257 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-40.i [2024-11-10 06:53:04,272 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:53:04,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:53:04,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:53:04,333 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;@201ad42f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:53:04,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:53:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:53:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:53:04,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:53:04,348 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:53:04,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:53:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:53:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash 216288892, now seen corresponding path program 1 times [2024-11-10 06:53:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:53:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556425299] [2024-11-10 06:53:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:53:04,369 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-11-10 06:53:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:53:04,372 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-11-10 06:53:04,373 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-11-10 06:53:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:53:04,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:53:04,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:53:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-10 06:53:04,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:53:04,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:53:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556425299] [2024-11-10 06:53:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556425299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:53:04,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:53:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:53:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304766403] [2024-11-10 06:53:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:53:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:53:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:53:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:53:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:53:04,747 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:53:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:53:04,764 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2024-11-10 06:53:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:53:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-10 06:53:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:53:04,771 INFO L225 Difference]: With dead ends: 110 [2024-11-10 06:53:04,771 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:53:04,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-11-10 06:53:04,776 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:53:04,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:53:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:53:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:53:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:53:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-10 06:53:04,813 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 125 [2024-11-10 06:53:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:53:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-10 06:53:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:53:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-10 06:53:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 06:53:04,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:53:04,820 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:53:04,833 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-11-10 06:53:05,021 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-11-10 06:53:05,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:53:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:53:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1304854114, now seen corresponding path program 1 times [2024-11-10 06:53:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:53:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208193651] [2024-11-10 06:53:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:53:05,023 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-11-10 06:53:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:53:05,025 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-11-10 06:53:05,027 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-11-10 06:53:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:53:05,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:53:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:53:05,583 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-10 06:53:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [755944239] [2024-11-10 06:53:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:53:05,584 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:53:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:53:05,587 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-11-10 06:53:05,588 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-11-10 06:53:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:53:06,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 06:53:06,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:53:32,986 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)