./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-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.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 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:56:23,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:56:23,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:56:23,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:56:23,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:56:23,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:56:23,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:56:23,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:56:23,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:56:23,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:56:23,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:56:23,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:56:23,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:56:23,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:56:23,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:56:23,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:56:23,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:56:23,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:56:23,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:56:23,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:56:23,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:56:23,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:56:23,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:56:23,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:56:23,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:56:23,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:56:23,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:56:23,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:56:23,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:56:23,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:56:23,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:56:23,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:56:23,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:23,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:56:23,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:56:23,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:56:23,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:56:23,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:56:23,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:56:23,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:56:23,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:56:23,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:56:23,271 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 -> 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc [2024-10-24 08:56:23,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:56:23,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:56:23,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:56:23,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:56:23,529 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:56:23,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:24,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:56:25,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:56:25,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:25,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5211a9f/22a5d793e94a42aa95a6936bed13fb67/FLAG863913280 [2024-10-24 08:56:25,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5211a9f/22a5d793e94a42aa95a6936bed13fb67 [2024-10-24 08:56:25,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:56:25,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:56:25,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:25,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:56:25,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:56:25,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56175038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25, skipping insertion in model container [2024-10-24 08:56:25,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:56:25,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i[916,929] [2024-10-24 08:56:25,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:25,404 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:56:25,416 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i[916,929] [2024-10-24 08:56:25,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:25,476 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:56:25,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25 WrapperNode [2024-10-24 08:56:25,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:25,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:25,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:56:25,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:56:25,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,544 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 08:56:25,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:25,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:56:25,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:56:25,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:56:25,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:56:25,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:56:25,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:56:25,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:56:25,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:56:25,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (1/1) ... [2024-10-24 08:56:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:25,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:56:25,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:56:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:56:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:56:25,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:56:25,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:56:25,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:56:25,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:56:25,810 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:56:25,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:56:26,089 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 08:56:26,090 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:56:26,128 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:56:26,128 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:56:26,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:26 BoogieIcfgContainer [2024-10-24 08:56:26,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:56:26,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:56:26,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:56:26,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:56:26,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:56:25" (1/3) ... [2024-10-24 08:56:26,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60420d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:26, skipping insertion in model container [2024-10-24 08:56:26,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:25" (2/3) ... [2024-10-24 08:56:26,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60420d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:26, skipping insertion in model container [2024-10-24 08:56:26,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:26" (3/3) ... [2024-10-24 08:56:26,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:26,156 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:56:26,157 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:56:26,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:56:26,217 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;@2f815463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:56:26,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:56:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:56:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:56:26,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:26,236 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:26,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 32373331, now seen corresponding path program 1 times [2024-10-24 08:56:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783875346] [2024-10-24 08:56:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:56:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:56:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:56:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:56:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:56:26,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783875346] [2024-10-24 08:56:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783875346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:56:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174558081] [2024-10-24 08:56:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:56:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:26,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:56:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:26,723 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:56:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:26,771 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-24 08:56:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:56:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 119 [2024-10-24 08:56:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:26,785 INFO L225 Difference]: With dead ends: 97 [2024-10-24 08:56:26,785 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 08:56:26,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:26,793 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:26,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 08:56:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 08:56:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:56:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-24 08:56:26,882 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 119 [2024-10-24 08:56:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:26,885 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-24 08:56:26,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:56:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-24 08:56:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:56:26,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:26,913 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:56:26,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 510628435, now seen corresponding path program 1 times [2024-10-24 08:56:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:26,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804422669] [2024-10-24 08:56:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:56:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:56:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:56:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:56:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 144 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-24 08:56:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804422669] [2024-10-24 08:56:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804422669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:56:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772608141] [2024-10-24 08:56:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:56:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:28,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:56:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:56:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:29,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 08:56:29,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 210 proven. 171 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-24 08:56:30,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:56:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 174 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-24 08:56:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772608141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:56:31,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:56:31,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 15] total 33 [2024-10-24 08:56:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339644210] [2024-10-24 08:56:31,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:56:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 08:56:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 08:56:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 08:56:31,208 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 33 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 9 states have call predecessors, (59), 10 states have call successors, (59) [2024-10-24 08:56:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:32,128 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2024-10-24 08:56:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 08:56:32,130 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 9 states have call predecessors, (59), 10 states have call successors, (59) Word has length 119 [2024-10-24 08:56:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:32,132 INFO L225 Difference]: With dead ends: 131 [2024-10-24 08:56:32,132 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 08:56:32,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=568, Invalid=1238, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 08:56:32,137 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 172 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:32,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 232 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:56:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 08:56:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2024-10-24 08:56:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:56:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-24 08:56:32,172 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 119 [2024-10-24 08:56:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:32,173 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-24 08:56:32,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (58), 5 states have call predecessors, (58), 12 states have return successors, (59), 9 states have call predecessors, (59), 10 states have call successors, (59) [2024-10-24 08:56:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-24 08:56:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 08:56:32,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:32,175 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:32,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 08:56:32,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:56:32,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:32,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1371145270, now seen corresponding path program 1 times [2024-10-24 08:56:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:32,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125121615] [2024-10-24 08:56:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:56:32,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:56:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:56:32,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:56:32,538 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:56:32,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:56:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:56:32,545 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 08:56:32,639 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:56:32,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:56:32 BoogieIcfgContainer [2024-10-24 08:56:32,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:56:32,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:56:32,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:56:32,645 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:56:32,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:26" (3/4) ... [2024-10-24 08:56:32,648 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:56:32,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:56:32,651 INFO L158 Benchmark]: Toolchain (without parser) took 7541.19ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 91.8MB in the beginning and 189.7MB in the end (delta: -97.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,652 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:56:32,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.74ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 77.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.04ms. Allocated memory is still 163.6MB. Free memory was 77.3MB in the beginning and 74.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,655 INFO L158 Benchmark]: Boogie Preprocessor took 62.07ms. Allocated memory is still 163.6MB. Free memory was 74.5MB in the beginning and 70.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,655 INFO L158 Benchmark]: RCFGBuilder took 513.30ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 70.9MB in the beginning and 187.1MB in the end (delta: -116.2MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,656 INFO L158 Benchmark]: TraceAbstraction took 6511.52ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 186.0MB in the beginning and 190.8MB in the end (delta: -4.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-10-24 08:56:32,656 INFO L158 Benchmark]: Witness Printer took 5.66ms. Allocated memory is still 268.4MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:56:32,658 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.74ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 77.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.04ms. Allocated memory is still 163.6MB. Free memory was 77.3MB in the beginning and 74.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.07ms. Allocated memory is still 163.6MB. Free memory was 74.5MB in the beginning and 70.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 513.30ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 70.9MB in the beginning and 187.1MB in the end (delta: -116.2MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6511.52ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 186.0MB in the beginning and 190.8MB in the end (delta: -4.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 5.66ms. Allocated memory is still 268.4MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] signed long int var_1_9 = 256; [L30] signed long int var_1_10 = 8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=256] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=256] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=256] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=256] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=16, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=2147483647, stepLocal_1=65534, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=1073872892, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=1073872892, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=1073872892, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=1073872892, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=65534, var_1_13=-4611686011984936961, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=1073872892, var_1_3=2147483647, var_1_4=1073741823, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 119 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 3401 SizeOfPredicates, 8 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2551/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:56:32,694 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-53.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 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:56:34,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:56:34,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:56:34,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:56:34,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:56:34,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:56:34,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:56:34,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:56:34,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:56:34,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:56:34,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:56:34,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:56:34,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:56:34,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:56:34,935 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:56:34,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:56:34,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:56:34,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:56:34,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:56:34,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:56:34,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:56:34,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:56:34,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:56:34,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:56:34,941 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:56:34,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:56:34,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:56:34,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:56:34,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:56:34,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:56:34,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:56:34,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:56:34,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:56:34,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:56:34,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:34,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:56:34,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:56:34,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:56:34,952 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:56:34,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:56:34,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:56:34,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:56:34,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:56:34,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:56:34,958 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:56:34,958 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 -> 2ed1635dc6d8064ed19cc47260dbac48845189c1db702c0725e361d24a01f9fc [2024-10-24 08:56:35,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:56:35,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:56:35,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:56:35,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:56:35,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:56:35,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:36,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:56:36,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:56:36,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:36,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fd0ed37/697d23749d3d4742beadd041efb16c11/FLAGd0acb3523 [2024-10-24 08:56:36,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fd0ed37/697d23749d3d4742beadd041efb16c11 [2024-10-24 08:56:36,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:56:36,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:56:36,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:36,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:56:37,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:56:37,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:36" (1/1) ... [2024-10-24 08:56:37,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8f9086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37, skipping insertion in model container [2024-10-24 08:56:37,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:36" (1/1) ... [2024-10-24 08:56:37,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:56:37,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i[916,929] [2024-10-24 08:56:37,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:37,288 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:56:37,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-53.i[916,929] [2024-10-24 08:56:37,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:37,353 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:56:37,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37 WrapperNode [2024-10-24 08:56:37,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:37,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:37,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:56:37,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:56:37,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,413 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-24 08:56:37,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:37,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:56:37,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:56:37,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:56:37,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,457 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:56:37,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:56:37,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:56:37,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:56:37,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:56:37,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (1/1) ... [2024-10-24 08:56:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:37,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:56:37,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:56:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:56:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:56:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:56:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:56:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:56:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:56:37,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:56:37,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:56:39,745 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 08:56:39,745 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:56:39,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:56:39,787 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:56:39,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:39 BoogieIcfgContainer [2024-10-24 08:56:39,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:56:39,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:56:39,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:56:39,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:56:39,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:56:36" (1/3) ... [2024-10-24 08:56:39,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dc767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:39, skipping insertion in model container [2024-10-24 08:56:39,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:37" (2/3) ... [2024-10-24 08:56:39,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dc767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:39, skipping insertion in model container [2024-10-24 08:56:39,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:39" (3/3) ... [2024-10-24 08:56:39,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-53.i [2024-10-24 08:56:39,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:56:39,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:56:39,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:56:39,889 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;@4a0f493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:56:39,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:56:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:56:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:56:39,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:39,904 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:39,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:39,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash 32373331, now seen corresponding path program 1 times [2024-10-24 08:56:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:56:39,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703357400] [2024-10-24 08:56:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:56:39,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:56:39,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:56:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:40,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:56:40,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-24 08:56:40,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:56:40,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:56:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703357400] [2024-10-24 08:56:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703357400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:56:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145366231] [2024-10-24 08:56:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:56:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:56:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:56:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:40,256 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:56:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:40,828 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-24 08:56:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:56:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 119 [2024-10-24 08:56:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:40,848 INFO L225 Difference]: With dead ends: 97 [2024-10-24 08:56:40,848 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 08:56:40,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:40,854 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:40,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:56:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 08:56:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 08:56:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:56:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-24 08:56:40,894 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 119 [2024-10-24 08:56:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:40,894 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-24 08:56:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:56:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-24 08:56:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:56:40,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:40,898 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:40,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:56:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:41,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 510628435, now seen corresponding path program 1 times [2024-10-24 08:56:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:56:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929918998] [2024-10-24 08:56:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:56:41,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:56:41,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:56:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:41,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 08:56:41,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 88 proven. 192 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:43,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:56:43,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:56:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929918998] [2024-10-24 08:56:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929918998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:56:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1646711105] [2024-10-24 08:56:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:56:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:56:43,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:56:43,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 08:56:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 08:56:43,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:57:34,706 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)