./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.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 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:08:36,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:08:36,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:08:36,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:08:36,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:08:36,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:08:36,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:08:36,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:08:36,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:08:36,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:08:36,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:08:36,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:08:36,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:08:36,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:08:36,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:08:36,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:08:36,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:08:36,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:08:36,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:08:36,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:08:36,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:08:36,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:08:36,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:08:36,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:08:36,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:08:36,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:08:36,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:08:36,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:08:36,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:08:36,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:08:36,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:08:36,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:08:36,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:08:36,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:08:36,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:08:36,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:08:36,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:08:36,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:08:36,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:08:36,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:08:36,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:08:36,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:08:36,977 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 -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-11-20 06:08:37,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:08:37,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:08:37,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:08:37,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:08:37,268 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:08:37,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:38,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:08:39,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:08:39,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:39,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a7b9aef/9cebd31a65484e7ca4ab72a04a62f8b0/FLAG2076b5f90 [2024-11-20 06:08:39,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a7b9aef/9cebd31a65484e7ca4ab72a04a62f8b0 [2024-11-20 06:08:39,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:08:39,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:08:39,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:08:39,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:08:39,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:08:39,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624267d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39, skipping insertion in model container [2024-11-20 06:08:39,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:08:39,590 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-98.i[916,929] [2024-11-20 06:08:39,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:08:39,652 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:08:39,666 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-98.i[916,929] [2024-11-20 06:08:39,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:08:39,712 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:08:39,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39 WrapperNode [2024-11-20 06:08:39,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:08:39,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:08:39,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:08:39,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:08:39,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,777 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-20 06:08:39,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:08:39,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:08:39,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:08:39,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:08:39,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,825 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-20 06:08:39,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:08:39,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:08:39,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:08:39,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:08:39,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (1/1) ... [2024-11-20 06:08:39,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:08:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:08:39,880 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-20 06:08:39,882 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-20 06:08:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:08:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:08:39,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:08:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:08:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:08:39,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:08:39,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:08:39,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:08:40,241 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 06:08:40,242 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:08:40,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:08:40,272 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:08:40,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:08:40 BoogieIcfgContainer [2024-11-20 06:08:40,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:08:40,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:08:40,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:08:40,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:08:40,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:08:39" (1/3) ... [2024-11-20 06:08:40,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cd81dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:08:40, skipping insertion in model container [2024-11-20 06:08:40,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:39" (2/3) ... [2024-11-20 06:08:40,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cd81dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:08:40, skipping insertion in model container [2024-11-20 06:08:40,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:08:40" (3/3) ... [2024-11-20 06:08:40,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:40,310 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:08:40,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:08:40,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:08:40,379 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;@289185d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:08:40,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:08:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 06:08:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 06:08:40,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:08:40,401 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:08:40,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:08:40,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:08:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -59891904, now seen corresponding path program 1 times [2024-11-20 06:08:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:08:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998493952] [2024-11-20 06:08:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:08:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:08:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:08:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:08:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:08:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:08:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:08:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:08:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:08:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:08:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:08:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:08:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:08:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:08:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:08:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 06:08:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:08:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:08:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:08:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 06:08:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:08:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 06:08:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:08:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 06:08:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 06:08:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:08:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998493952] [2024-11-20 06:08:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998493952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:08:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:08:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:08:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641305427] [2024-11-20 06:08:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:08:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:08:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:08:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:08:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:08:40,922 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 06:08:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:08:40,961 INFO L93 Difference]: Finished difference Result 125 states and 215 transitions. [2024-11-20 06:08:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:08:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2024-11-20 06:08:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:08:40,973 INFO L225 Difference]: With dead ends: 125 [2024-11-20 06:08:40,973 INFO L226 Difference]: Without dead ends: 62 [2024-11-20 06:08:40,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:08:40,983 INFO L432 NwaCegarLoop]: 92 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, 92 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-20 06:08:40,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:08:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-20 06:08:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-20 06:08:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 06:08:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-20 06:08:41,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 142 [2024-11-20 06:08:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:08:41,040 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-20 06:08:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 06:08:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-20 06:08:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 06:08:41,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:08:41,046 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:08:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:08:41,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:08:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:08:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -66713794, now seen corresponding path program 1 times [2024-11-20 06:08:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:08:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327725501] [2024-11-20 06:08:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:08:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:08:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:08:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:08:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:08:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:08:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:08:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:08:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:08:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:08:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:08:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:08:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:08:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:08:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:08:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 06:08:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:08:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:08:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:08:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 06:08:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:08:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 06:08:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:08:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 06:08:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 06:08:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:08:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327725501] [2024-11-20 06:08:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327725501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:08:41,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:08:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:08:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993946941] [2024-11-20 06:08:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:08:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:08:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:08:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:08:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:08:41,472 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 06:08:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:08:41,575 INFO L93 Difference]: Finished difference Result 123 states and 183 transitions. [2024-11-20 06:08:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:08:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2024-11-20 06:08:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:08:41,580 INFO L225 Difference]: With dead ends: 123 [2024-11-20 06:08:41,580 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 06:08:41,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:08:41,584 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:08:41,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 231 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:08:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 06:08:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-11-20 06:08:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 06:08:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-20 06:08:41,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 142 [2024-11-20 06:08:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:08:41,625 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-20 06:08:41,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 06:08:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-20 06:08:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 06:08:41,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:08:41,631 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:08:41,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:08:41,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:08:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:08:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -235902567, now seen corresponding path program 1 times [2024-11-20 06:08:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:08:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327909003] [2024-11-20 06:08:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:08:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:08:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997885909] [2024-11-20 06:08:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:08:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:08:41,841 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-20 06:08:41,842 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-20 06:08:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:08:42,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:08:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:08:42,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:08:42,190 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:08:42,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:08:42,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:08:42,393 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-20 06:08:42,397 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 06:08:42,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:08:42,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:08:42 BoogieIcfgContainer [2024-11-20 06:08:42,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:08:42,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:08:42,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:08:42,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:08:42,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:08:40" (3/4) ... [2024-11-20 06:08:42,518 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:08:42,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:08:42,520 INFO L158 Benchmark]: Toolchain (without parser) took 3128.92ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 96.4MB in the beginning and 133.5MB in the end (delta: -37.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,521 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:08:42,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.31ms. Allocated memory is still 153.1MB. Free memory was 96.4MB in the beginning and 82.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.17ms. Allocated memory is still 153.1MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,523 INFO L158 Benchmark]: Boogie Preprocessor took 58.37ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,524 INFO L158 Benchmark]: RCFGBuilder took 432.22ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 123.0MB in the end (delta: -45.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,524 INFO L158 Benchmark]: TraceAbstraction took 2233.66ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 122.3MB in the beginning and 134.6MB in the end (delta: -12.3MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-11-20 06:08:42,524 INFO L158 Benchmark]: Witness Printer took 9.26ms. Allocated memory is still 218.1MB. Free memory was 134.6MB in the beginning and 133.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:08:42,526 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.31ms. Allocated memory is still 153.1MB. Free memory was 96.4MB in the beginning and 82.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.17ms. Allocated memory is still 153.1MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.37ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 432.22ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 123.0MB in the end (delta: -45.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2233.66ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 122.3MB in the beginning and 134.6MB in the end (delta: -12.3MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 9.26ms. Allocated memory is still 218.1MB. Free memory was 134.6MB in the beginning and 133.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 4; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 9999999; [L25] signed long int var_1_4 = 0; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 7; [L30] signed long int var_1_10 = 7; [L31] signed long int var_1_11 = 2; [L32] unsigned long int var_1_12 = 128; [L33] unsigned long int var_1_13 = 0; [L34] unsigned long int var_1_14 = 4078799264; [L35] unsigned long int var_1_15 = 500; [L36] unsigned long int var_1_16 = 25; [L37] unsigned long int last_1_var_1_15 = 500; VAL [isInitial=0, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=63, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=63, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L66] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L66] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=9999999, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L67] var_1_3 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L68] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_7=-1, var_1_8=4, var_1_9=7] [L70] var_1_6 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L72] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L72] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=-1, var_1_8=4, var_1_9=7] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L74] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L75] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L75] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L76] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L76] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=4, var_1_9=7] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L78] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=7] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=7, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L87] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L89] var_1_13 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L91] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L91] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L92] var_1_14 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L93] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L94] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L94] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L95] var_1_16 = __VERIFIER_nondet_ulong() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L97] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=9, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=9, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L97] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=9, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L111] RET updateVariables() [L112] CALL step() [L41] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=500, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L42] COND FALSE !(((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) [L49] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L51] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L51] unsigned long int stepLocal_0 = (var_1_15 >> var_1_6) / var_1_7; [L52] COND TRUE 8 < stepLocal_0 [L53] var_1_4 = (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L55] COND FALSE !(var_1_2 < var_1_8) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103] EXPR (var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L103-L104] return (((var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((signed long int) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1)) && ((var_1_2 < var_1_8) ? ((((- var_1_15) <= var_1_6) || (var_1_4 < var_1_10)) ? (var_1_12 == ((unsigned long int) ((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))))) : (var_1_12 == ((unsigned long int) (var_1_14 - var_1_6)))) : 1)) && ((((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) ? ((last_1_var_1_15 > var_1_7) ? (var_1_15 == ((unsigned long int) (var_1_6 + var_1_16))) : (var_1_15 == ((unsigned long int) var_1_14))) : (var_1_15 == ((unsigned long int) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=500, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=128, var_1_13=-4294967296, var_1_14=2147483647, var_1_15=9, var_1_16=9, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 180 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:08:42,559 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.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 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:08:44,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:08:45,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:08:45,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:08:45,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:08:45,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:08:45,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:08:45,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:08:45,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:08:45,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:08:45,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:08:45,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:08:45,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:08:45,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:08:45,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:08:45,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:08:45,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:08:45,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:08:45,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:08:45,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:08:45,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:08:45,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:08:45,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:08:45,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:08:45,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:08:45,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:08:45,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:08:45,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:08:45,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:08:45,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:08:45,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:08:45,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:08:45,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:08:45,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:08:45,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:08:45,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:08:45,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:08:45,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:08:45,106 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:08:45,106 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:08:45,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:08:45,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:08:45,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:08:45,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:08:45,107 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 -> 9892fa4411afdcbbbffaaa3a5f66b66df3561d966071f6e07747bea9e43a53de [2024-11-20 06:08:45,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:08:45,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:08:45,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:08:45,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:08:45,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:08:45,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:47,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:08:47,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:08:47,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:47,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942a1d06f/e653728701ae41d38a5a2530927f4501/FLAG33b6c9a6f [2024-11-20 06:08:47,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942a1d06f/e653728701ae41d38a5a2530927f4501 [2024-11-20 06:08:47,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:08:47,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:08:47,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:08:47,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:08:47,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:08:47,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e06c34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47, skipping insertion in model container [2024-11-20 06:08:47,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:08:47,687 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-98.i[916,929] [2024-11-20 06:08:47,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:08:47,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:08:47,787 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-98.i[916,929] [2024-11-20 06:08:47,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:08:47,843 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:08:47,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47 WrapperNode [2024-11-20 06:08:47,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:08:47,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:08:47,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:08:47,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:08:47,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,904 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-20 06:08:47,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:08:47,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:08:47,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:08:47,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:08:47,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,939 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-20 06:08:47,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:08:47,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:08:47,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:08:47,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:08:47,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (1/1) ... [2024-11-20 06:08:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:08:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:08:48,019 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-20 06:08:48,022 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-20 06:08:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:08:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:08:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:08:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:08:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:08:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:08:48,167 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:08:48,169 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:08:56,650 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 06:08:56,651 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:08:56,663 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:08:56,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:08:56,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:08:56 BoogieIcfgContainer [2024-11-20 06:08:56,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:08:56,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:08:56,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:08:56,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:08:56,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:08:47" (1/3) ... [2024-11-20 06:08:56,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe9cbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:08:56, skipping insertion in model container [2024-11-20 06:08:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:08:47" (2/3) ... [2024-11-20 06:08:56,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe9cbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:08:56, skipping insertion in model container [2024-11-20 06:08:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:08:56" (3/3) ... [2024-11-20 06:08:56,672 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-98.i [2024-11-20 06:08:56,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:08:56,689 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:08:56,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:08:56,762 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;@54ffe065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:08:56,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:08:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 06:08:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 06:08:56,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:08:56,784 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:08:56,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:08:56,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:08:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash 332693887, now seen corresponding path program 1 times [2024-11-20 06:08:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:08:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877752049] [2024-11-20 06:08:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:56,807 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-20 06:08:56,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:08:56,811 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-20 06:08:56,812 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-20 06:08:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:57,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:08:57,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:08:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-20 06:08:57,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:08:57,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:08:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877752049] [2024-11-20 06:08:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877752049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:08:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:08:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:08:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393078524] [2024-11-20 06:08:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:08:57,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:08:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:08:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:08:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:08:57,294 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 06:08:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:08:57,322 INFO L93 Difference]: Finished difference Result 111 states and 195 transitions. [2024-11-20 06:08:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:08:57,325 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2024-11-20 06:08:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:08:57,334 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:08:57,334 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 06:08:57,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-20 06:08:57,343 INFO L432 NwaCegarLoop]: 82 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, 82 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-20 06:08:57,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:08:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 06:08:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-20 06:08:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 06:08:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-20 06:08:57,403 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 139 [2024-11-20 06:08:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:08:57,405 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-20 06:08:57,405 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 06:08:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-20 06:08:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 06:08:57,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:08:57,412 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:08:57,427 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-20 06:08:57,612 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-20 06:08:57,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:08:57,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:08:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1265617473, now seen corresponding path program 1 times [2024-11-20 06:08:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:08:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033604179] [2024-11-20 06:08:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:57,618 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-20 06:08:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:08:57,622 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-20 06:08:57,624 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-20 06:08:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:08:58,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:08:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:08:58,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-20 06:08:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1308421916] [2024-11-20 06:08:58,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:08:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:08:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:08:58,496 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-20 06:08:58,497 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-20 06:08:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:08:58,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 06:08:59,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:09:07,722 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:16,004 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:24,118 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:32,340 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:40,577 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:48,680 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:09:56,917 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:10:05,163 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:10:09,225 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_10~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 10.0)))) (let ((.cse0 (fp.lt .cse4 .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_~var_1_9~0 c_~var_1_8~0))) (.cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 793.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)))) (or (and (not .cse0) (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3)))) (and .cse0 (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse4) .cse3))))))) (= c_~var_1_15~0 c_~var_1_16~0) (= (bvadd c_~var_1_2~0 (bvneg c_~var_1_3~0)) c_~var_1_1~0) (not (bvult (_ bv4294967168 32) c_~var_1_13~0)) (not (bvult c_~last_1_var_1_15~0 c_~var_1_13~0))) is different from false [2024-11-20 06:10:13,291 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_10~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 10.0)))) (let ((.cse0 (fp.lt .cse4 .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_~var_1_9~0 c_~var_1_8~0))) (.cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 793.0 8.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)))) (or (and (not .cse0) (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3)))) (and .cse0 (= c_~var_1_4~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse4) .cse3))))))) (= c_~var_1_15~0 c_~var_1_16~0) (= (bvadd c_~var_1_2~0 (bvneg c_~var_1_3~0)) c_~var_1_1~0) (not (bvult (_ bv4294967168 32) c_~var_1_13~0)) (not (bvult c_~last_1_var_1_15~0 c_~var_1_13~0))) is different from true