./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-95.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-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:00:37,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:00:37,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:00:37,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:00:37,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:00:37,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:00:37,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:00:37,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:00:37,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:00:37,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:00:37,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:00:37,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:00:37,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:00:37,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:00:37,558 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:00:37,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:00:37,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:00:37,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:00:37,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:00:37,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:00:37,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:00:37,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:00:37,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:00:37,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:00:37,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:00:37,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:00:37,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:00:37,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:00:37,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:00:37,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:00:37,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:00:37,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:00:37,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:37,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:00:37,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:00:37,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:00:37,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:00:37,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:00:37,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:00:37,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:00:37,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:00:37,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:00:37,567 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-10-24 09:00:37,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:00:37,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:00:37,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:00:37,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:00:37,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:00:37,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:39,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:00:39,321 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:00:39,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:39,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79caaba33/a04f8349863142cebb6fd99f35fea34c/FLAG43115c007 [2024-10-24 09:00:39,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79caaba33/a04f8349863142cebb6fd99f35fea34c [2024-10-24 09:00:39,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:00:39,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:00:39,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:39,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:00:39,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:00:39,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726a96c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39, skipping insertion in model container [2024-10-24 09:00:39,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:00:39,507 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-95.i[916,929] [2024-10-24 09:00:39,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:39,630 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:00:39,648 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-95.i[916,929] [2024-10-24 09:00:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:39,680 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:00:39,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39 WrapperNode [2024-10-24 09:00:39,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:39,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:39,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:00:39,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:00:39,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,722 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-24 09:00:39,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:39,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:00:39,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:00:39,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:00:39,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,764 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 09:00:39,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:00:39,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:00:39,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:00:39,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:00:39,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (1/1) ... [2024-10-24 09:00:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:00:39,824 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 09:00:39,827 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 09:00:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:00:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:00:39,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:00:39,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:00:39,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:00:39,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:00:39,934 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:00:39,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:00:40,219 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 09:00:40,223 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:00:40,258 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:00:40,261 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:00:40,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:40 BoogieIcfgContainer [2024-10-24 09:00:40,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:00:40,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:00:40,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:00:40,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:00:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:00:39" (1/3) ... [2024-10-24 09:00:40,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecad8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:40, skipping insertion in model container [2024-10-24 09:00:40,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:39" (2/3) ... [2024-10-24 09:00:40,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecad8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:40, skipping insertion in model container [2024-10-24 09:00:40,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:40" (3/3) ... [2024-10-24 09:00:40,270 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:40,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:00:40,283 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:00:40,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:00:40,349 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;@2c91c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:00:40,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:00:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:00:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 09:00:40,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:40,368 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:40,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:40,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash 240794627, now seen corresponding path program 1 times [2024-10-24 09:00:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959286420] [2024-10-24 09:00:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:00:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:00:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:00:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959286420] [2024-10-24 09:00:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959286420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:00:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152196920] [2024-10-24 09:00:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:00:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:00:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:00:40,712 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:00:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:40,750 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2024-10-24 09:00:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:00:40,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-10-24 09:00:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:40,758 INFO L225 Difference]: With dead ends: 119 [2024-10-24 09:00:40,758 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 09:00:40,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 09:00:40,767 INFO L432 NwaCegarLoop]: 85 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, 85 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 09:00:40,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:00:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 09:00:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 09:00:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:00:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-10-24 09:00:40,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 118 [2024-10-24 09:00:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:40,822 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-10-24 09:00:40,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:00:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-10-24 09:00:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 09:00:40,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:40,825 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:00:40,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1525734331, now seen corresponding path program 1 times [2024-10-24 09:00:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141164322] [2024-10-24 09:00:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:00:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:00:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:00:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141164322] [2024-10-24 09:00:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141164322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:00:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408302184] [2024-10-24 09:00:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:41,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:00:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:00:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:00:41,162 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:00:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:41,197 INFO L93 Difference]: Finished difference Result 118 states and 177 transitions. [2024-10-24 09:00:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:00:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-24 09:00:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:41,201 INFO L225 Difference]: With dead ends: 118 [2024-10-24 09:00:41,203 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 09:00:41,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:00:41,205 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:41,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:00:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 09:00:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-24 09:00:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:00:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-10-24 09:00:41,220 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 118 [2024-10-24 09:00:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-10-24 09:00:41,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:00:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-10-24 09:00:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 09:00:41,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:41,226 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:41,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:00:41,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1725287539, now seen corresponding path program 1 times [2024-10-24 09:00:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081248052] [2024-10-24 09:00:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:00:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243669513] [2024-10-24 09:00:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:00:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:00:41,292 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 09:00:41,295 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 09:00:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:00:41,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:00:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:00:41,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:00:41,587 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:00:41,588 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:00:41,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:00:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:00:41,796 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:00:41,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:00:41,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:00:41 BoogieIcfgContainer [2024-10-24 09:00:41,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:00:41,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:00:41,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:00:41,889 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:00:41,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:40" (3/4) ... [2024-10-24 09:00:41,891 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:00:41,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:00:41,893 INFO L158 Benchmark]: Toolchain (without parser) took 2547.97ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 54.0MB in the end (delta: 35.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,893 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 115.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:00:41,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.71ms. Allocated memory is still 159.4MB. Free memory was 89.6MB in the beginning and 127.7MB in the end (delta: -38.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.26ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 124.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,894 INFO L158 Benchmark]: Boogie Preprocessor took 69.55ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 119.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,894 INFO L158 Benchmark]: RCFGBuilder took 468.41ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 97.3MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,894 INFO L158 Benchmark]: TraceAbstraction took 1625.72ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 54.0MB in the end (delta: 42.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-24 09:00:41,895 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 159.4MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:00:41,896 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.15ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 115.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.71ms. Allocated memory is still 159.4MB. Free memory was 89.6MB in the beginning and 127.7MB in the end (delta: -38.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.26ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 124.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.55ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 119.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 468.41ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 97.3MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1625.72ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 54.0MB in the end (delta: 42.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 159.4MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed long int var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = 255; [L26] signed long int var_1_6 = 50; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_7 = var_1_7 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_long() [L59] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L61] var_1_5 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L62] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L64] var_1_6 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L67] var_1_8 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L69] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L70] var_1_10 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L72] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L72] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L79] var_1_14 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L81] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L82] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L84] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L85] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L99] RET updateVariables() [L100] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND FALSE !(var_1_16 >= var_1_1) [L53] var_1_13 = 256 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91-L92] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 169 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 09:00:41,925 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-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:00:44,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:00:44,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:00:44,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:00:44,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:00:44,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:00:44,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:00:44,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:00:44,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:00:44,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:00:44,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:00:44,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:00:44,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:00:44,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:00:44,133 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:00:44,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:00:44,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:00:44,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:00:44,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:00:44,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:00:44,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:00:44,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:00:44,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:00:44,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:00:44,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:00:44,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:00:44,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:00:44,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:00:44,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:00:44,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:00:44,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:00:44,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:00:44,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:00:44,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:00:44,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:44,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:00:44,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:00:44,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:00:44,143 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:00:44,143 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:00:44,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:00:44,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:00:44,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:00:44,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:00:44,145 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:00:44,145 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-10-24 09:00:44,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:00:44,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:00:44,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:00:44,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:00:44,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:00:44,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:45,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:00:46,003 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:00:46,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:46,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6bd5d764/2f2d456ec1324b39856c245088441f88/FLAGe009551ef [2024-10-24 09:00:46,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6bd5d764/2f2d456ec1324b39856c245088441f88 [2024-10-24 09:00:46,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:00:46,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:00:46,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:46,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:00:46,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:00:46,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ba3e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46, skipping insertion in model container [2024-10-24 09:00:46,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:00:46,201 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-95.i[916,929] [2024-10-24 09:00:46,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:46,273 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:00:46,284 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-95.i[916,929] [2024-10-24 09:00:46,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:46,345 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:00:46,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46 WrapperNode [2024-10-24 09:00:46,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:46,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:46,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:00:46,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:00:46,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,398 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-24 09:00:46,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:46,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:00:46,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:00:46,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:00:46,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,424 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 09:00:46,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:00:46,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:00:46,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:00:46,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:00:46,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (1/1) ... [2024-10-24 09:00:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:46,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:00:46,497 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 09:00:46,499 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 09:00:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:00:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:00:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:00:46,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:00:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:00:46,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:00:46,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:00:46,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:00:53,301 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 09:00:53,302 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:00:53,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:00:53,343 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:00:53,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:53 BoogieIcfgContainer [2024-10-24 09:00:53,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:00:53,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:00:53,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:00:53,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:00:53,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:00:46" (1/3) ... [2024-10-24 09:00:53,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d846412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:53, skipping insertion in model container [2024-10-24 09:00:53,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:46" (2/3) ... [2024-10-24 09:00:53,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d846412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:53, skipping insertion in model container [2024-10-24 09:00:53,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:53" (3/3) ... [2024-10-24 09:00:53,351 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-24 09:00:53,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:00:53,363 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:00:53,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:00:53,420 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;@4c3257ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:00:53,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:00:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:00:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 09:00:53,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:53,432 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:53,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:53,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 111626331, now seen corresponding path program 1 times [2024-10-24 09:00:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:00:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551265588] [2024-10-24 09:00:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:53,447 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 09:00:53,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:00:53,449 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 09:00:53,450 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 09:00:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:00:53,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:00:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:00:53,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:00:53,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:00:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551265588] [2024-10-24 09:00:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551265588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:53,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:00:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254340047] [2024-10-24 09:00:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:00:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:00:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:00:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:00:53,811 INFO L87 Difference]: Start difference. First operand has 44 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:00:56,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:00:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:56,619 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2024-10-24 09:00:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:00:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 111 [2024-10-24 09:00:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:56,646 INFO L225 Difference]: With dead ends: 85 [2024-10-24 09:00:56,646 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 09:00:56,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 09:00:56,650 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:56,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 09:00:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 09:00:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 09:00:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:00:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-24 09:00:56,685 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 111 [2024-10-24 09:00:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:56,686 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-24 09:00:56,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:00:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-24 09:00:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 09:00:56,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:56,689 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:56,697 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-24 09:00:56,889 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 09:00:56,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:56,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 667812955, now seen corresponding path program 1 times [2024-10-24 09:00:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:00:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499152199] [2024-10-24 09:00:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:56,893 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 09:00:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:00:56,897 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 09:00:56,899 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 09:00:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:57,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:00:57,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:00:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-24 09:00:57,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:00:57,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:00:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499152199] [2024-10-24 09:00:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499152199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:00:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1997560378] [2024-10-24 09:00:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:57,647 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:00:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:00:57,652 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 09:00:57,653 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 09:00:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:57,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:00:57,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:00:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-24 09:00:58,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:00:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1997560378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:00:58,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:00:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-10-24 09:00:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454478539] [2024-10-24 09:00:58,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:00:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 09:00:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:00:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 09:00:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:00:58,843 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-24 09:01:02,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:01:04,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:01:07,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:01:10,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:01:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:10,988 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2024-10-24 09:01:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 09:01:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 112 [2024-10-24 09:01:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:11,011 INFO L225 Difference]: With dead ends: 141 [2024-10-24 09:01:11,011 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 09:01:11,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2024-10-24 09:01:11,013 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:01:11,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-10-24 09:01:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 09:01:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 46. [2024-10-24 09:01:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:01:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-24 09:01:11,027 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 112 [2024-10-24 09:01:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-24 09:01:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-24 09:01:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-24 09:01:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 09:01:11,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:11,030 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:01:11,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 09:01:11,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:01:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:01:11,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 610554653, now seen corresponding path program 1 times [2024-10-24 09:01:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:01:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568588195] [2024-10-24 09:01:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:11,437 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 09:01:11,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:01:11,441 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:01:11,442 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 (5)] Waiting until timeout for monitored process [2024-10-24 09:01:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:11,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:01:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:01:11,933 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 09:01:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1425590322] [2024-10-24 09:01:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:01:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:01:11,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:01:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 09:01:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:12,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 09:01:12,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:01:32,752 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:01:40,851 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:01:47,554 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:01:54,998 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 513.0 2.0))) (.cse3 (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_6~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 129.0 8.0))))) (let ((.cse0 (fp.lt .cse2 .cse3)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (bvadd c_~var_1_4~0 (bvneg c_~var_1_5~0))))) (or (and .cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse2)) c_~var_1_3~0)) (and (not .cse0) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse3)) c_~var_1_3~0))))) (= c_~var_1_16~0 c_~var_1_17~0) (= c_~var_1_1~0 ((_ zero_extend 24) c_~last_1_var_1_7~0)) (bvsle ((_ zero_extend 24) c_~var_1_12~0) (_ bv127 32)) (bvsle ((_ zero_extend 24) c_~var_1_11~0) (_ bv127 32))) is different from false [2024-10-24 09:01:59,021 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 513.0 2.0))) (.cse3 (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_6~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 129.0 8.0))))) (let ((.cse0 (fp.lt .cse2 .cse3)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (bvadd c_~var_1_4~0 (bvneg c_~var_1_5~0))))) (or (and .cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse2)) c_~var_1_3~0)) (and (not .cse0) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse1 .cse3)) c_~var_1_3~0))))) (= c_~var_1_16~0 c_~var_1_17~0) (= c_~var_1_1~0 ((_ zero_extend 24) c_~last_1_var_1_7~0)) (bvsle ((_ zero_extend 24) c_~var_1_12~0) (_ bv127 32)) (bvsle ((_ zero_extend 24) c_~var_1_11~0) (_ bv127 32))) is different from true [2024-10-24 09:02:07,131 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:02:13,468 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:02:21,560 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)