./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.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 0f345c9368439d50a8cf63608ba7de35a292fc0f8aa5f6f836e3b6ffd1ec671a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:02:01,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:02:02,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:02:02,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:02:02,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:02:02,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:02:02,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:02:02,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:02:02,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:02:02,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:02:02,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:02:02,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:02:02,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:02:02,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:02:02,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:02:02,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:02:02,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:02:02,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:02:02,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:02:02,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:02:02,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:02:02,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:02:02,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:02:02,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:02:02,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:02:02,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:02:02,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:02:02,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:02:02,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:02:02,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:02:02,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:02:02,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:02:02,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:02:02,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:02:02,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:02:02,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:02:02,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:02:02,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:02:02,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:02:02,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:02:02,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:02:02,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:02:02,112 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 -> 0f345c9368439d50a8cf63608ba7de35a292fc0f8aa5f6f836e3b6ffd1ec671a [2024-11-08 23:02:02,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:02:02,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:02:02,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:02:02,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:02:02,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:02:02,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:03,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:02:04,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:02:04,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:04,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb154d562/689aea83ccbf41d094e3cd640ff34f7e/FLAGb69dcbcee [2024-11-08 23:02:04,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb154d562/689aea83ccbf41d094e3cd640ff34f7e [2024-11-08 23:02:04,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:02:04,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:02:04,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:04,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:02:04,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:02:04,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8d9dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04, skipping insertion in model container [2024-11-08 23:02:04,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:02:04,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i[917,930] [2024-11-08 23:02:04,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:04,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:02:04,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i[917,930] [2024-11-08 23:02:04,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:04,499 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:02:04,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04 WrapperNode [2024-11-08 23:02:04,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:04,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:04,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:02:04,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:02:04,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,546 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-08 23:02:04,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:04,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:02:04,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:02:04,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:02:04,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:02:04,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:02:04,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:02:04,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:02:04,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:02:04,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:02:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:02:04,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:02:04,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:02:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:02:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:02:04,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:02:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:02:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:02:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:02:04,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:02:04,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:02:05,013 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:02:05,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:02:05,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:02:05,025 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:02:05,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:05 BoogieIcfgContainer [2024-11-08 23:02:05,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:02:05,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:02:05,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:02:05,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:02:05,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:02:04" (1/3) ... [2024-11-08 23:02:05,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceb352b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:02:05, skipping insertion in model container [2024-11-08 23:02:05,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:04" (2/3) ... [2024-11-08 23:02:05,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceb352b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:02:05, skipping insertion in model container [2024-11-08 23:02:05,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:05" (3/3) ... [2024-11-08 23:02:05,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:05,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:02:05,048 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:02:05,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:02:05,101 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;@5059b6c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:02:05,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:02:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:02:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:02:05,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:02:05,116 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:02:05,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:02:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash 277193381, now seen corresponding path program 1 times [2024-11-08 23:02:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:02:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791401321] [2024-11-08 23:02:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:02:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:02:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:02:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:02:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:02:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:02:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:02:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:02:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:02:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:02:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:02:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:02:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:02:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:02:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791401321] [2024-11-08 23:02:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791401321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:02:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:02:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:02:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000084786] [2024-11-08 23:02:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:02:05,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:02:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:02:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:02:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:02:05,452 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:02:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:02:05,472 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2024-11-08 23:02:05,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:02:05,474 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-08 23:02:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:02:05,480 INFO L225 Difference]: With dead ends: 95 [2024-11-08 23:02:05,481 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 23:02:05,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:02:05,486 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:02:05,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:02:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 23:02:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 23:02:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:02:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-08 23:02:05,520 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 83 [2024-11-08 23:02:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:02:05,520 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-08 23:02:05,521 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:02:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-08 23:02:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:02:05,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:02:05,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:02:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:02:05,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:02:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 372638945, now seen corresponding path program 1 times [2024-11-08 23:02:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:02:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755825792] [2024-11-08 23:02:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:05,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:02:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:02:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:02:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:02:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:02:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:02:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:02:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:02:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:02:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:02:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:02:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:02:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:02:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:02:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755825792] [2024-11-08 23:02:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755825792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:02:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:02:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:02:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801237460] [2024-11-08 23:02:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:02:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:02:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:02:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:02:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:02:06,002 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:02:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:02:06,119 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-11-08 23:02:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:02:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-08 23:02:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:02:06,122 INFO L225 Difference]: With dead ends: 92 [2024-11-08 23:02:06,122 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:02:06,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:02:06,126 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:02:06,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:02:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:02:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-08 23:02:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:02:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-08 23:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 83 [2024-11-08 23:02:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:02:06,144 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-08 23:02:06,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:02:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-08 23:02:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 23:02:06,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:02:06,148 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:02:06,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:02:06,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:02:06,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1075284092, now seen corresponding path program 1 times [2024-11-08 23:02:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:02:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522328872] [2024-11-08 23:02:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:02:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935689240] [2024-11-08 23:02:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:06,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:02:06,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:02:06,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:02:06,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:02:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:02:06,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:02:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:02:06,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:02:06,520 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:02:06,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:02:06,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:02:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:02:06,732 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:02:06,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:02:06,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:02:06 BoogieIcfgContainer [2024-11-08 23:02:06,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:02:06,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:02:06,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:02:06,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:02:06,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:05" (3/4) ... [2024-11-08 23:02:06,825 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:02:06,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:02:06,826 INFO L158 Benchmark]: Toolchain (without parser) took 2715.76ms. Allocated memory is still 169.9MB. Free memory was 101.1MB in the beginning and 49.7MB in the end (delta: 51.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,827 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:02:06,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.68ms. Allocated memory is still 169.9MB. Free memory was 100.9MB in the beginning and 137.3MB in the end (delta: -36.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.26ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 135.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,828 INFO L158 Benchmark]: Boogie Preprocessor took 51.26ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 132.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,828 INFO L158 Benchmark]: RCFGBuilder took 426.28ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 115.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,829 INFO L158 Benchmark]: TraceAbstraction took 1794.40ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 50.7MB in the end (delta: 63.5MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-11-08 23:02:06,829 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 169.9MB. Free memory was 50.7MB in the beginning and 49.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:02:06,832 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.17ms. Allocated memory is still 109.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.68ms. Allocated memory is still 169.9MB. Free memory was 100.9MB in the beginning and 137.3MB in the end (delta: -36.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.26ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 135.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.26ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 132.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 426.28ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 115.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1794.40ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 50.7MB in the end (delta: 63.5MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 169.9MB. Free memory was 50.7MB in the beginning and 49.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] unsigned short int var_1_7 = 256; [L27] signed long int var_1_8 = 50; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = -4; [L30] float var_1_11 = 15.125; [L31] float var_1_12 = 0.9; [L32] double var_1_13 = 25.875; [L33] unsigned short int var_1_14 = 50; [L34] signed short int last_1_var_1_1 = 2; [L35] unsigned short int last_1_var_1_6 = 128; [L36] signed long int last_1_var_1_8 = 50; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L89] last_1_var_1_1 = var_1_1 [L90] last_1_var_1_6 = var_1_6 [L91] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L72] var_1_5 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L73] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L75] var_1_7 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=0] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L85] var_1_12 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L41] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L43] signed long int stepLocal_0 = 1 * var_1_4; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L44] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=-32769, var_1_8=50, var_1_9=1] [L44] COND TRUE (var_1_1 >> var_1_5) > stepLocal_0 [L45] var_1_6 = (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L49] var_1_11 = var_1_12 [L50] var_1_13 = var_1_12 [L51] var_1_14 = var_1_7 [L52] signed long int stepLocal_2 = var_1_4 / var_1_10; [L53] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=-32769, stepLocal_2=-1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L54] COND TRUE \read(var_1_9) [L55] var_1_8 = ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=-32769, stepLocal_2=-1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L94] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L94-L95] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7)))) && (var_1_9 ? (var_1_8 == ((signed long int) ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))))) : ((var_1_14 > (var_1_4 / var_1_10)) ? ((var_1_7 > var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_4) < (100)) ? (var_1_4) : (100))))) : (var_1_8 == ((signed long int) (last_1_var_1_8 - var_1_7)))) : (var_1_8 == ((signed long int) (var_1_6 + var_1_5)))))) && (var_1_11 == ((float) var_1_12))) && (var_1_13 == ((double) var_1_12))) && (var_1_14 == ((unsigned short int) var_1_7)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=-32769, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=-32769, var_1_8=50, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 117 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 528/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:02:06,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.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 0f345c9368439d50a8cf63608ba7de35a292fc0f8aa5f6f836e3b6ffd1ec671a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:02:09,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:02:09,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:02:09,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:02:09,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:02:09,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:02:09,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:02:09,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:02:09,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:02:09,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:02:09,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:02:09,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:02:09,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:02:09,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:02:09,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:02:09,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:02:09,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:02:09,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:02:09,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:02:09,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:02:09,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:02:09,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:02:09,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:02:09,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:02:09,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:02:09,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:02:09,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:02:09,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:02:09,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:02:09,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:02:09,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:02:09,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:02:09,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:02:09,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:02:09,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:02:09,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:02:09,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:02:09,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:02:09,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:02:09,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:02:09,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:02:09,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:02:09,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:02:09,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:02:09,152 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 -> 0f345c9368439d50a8cf63608ba7de35a292fc0f8aa5f6f836e3b6ffd1ec671a [2024-11-08 23:02:09,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:02:09,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:02:09,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:02:09,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:02:09,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:02:09,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:11,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:02:11,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:02:11,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:11,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b72fc95/156b65705c4a47efaf884ac1e75bf444/FLAG317db1c1e [2024-11-08 23:02:11,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b72fc95/156b65705c4a47efaf884ac1e75bf444 [2024-11-08 23:02:11,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:02:11,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:02:11,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:11,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:02:11,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:02:11,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792ba481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11, skipping insertion in model container [2024-11-08 23:02:11,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:02:11,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i[917,930] [2024-11-08 23:02:11,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:11,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:02:11,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-67.i[917,930] [2024-11-08 23:02:11,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:11,661 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:02:11,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11 WrapperNode [2024-11-08 23:02:11,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:11,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:11,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:02:11,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:02:11,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,713 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-08 23:02:11,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:11,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:02:11,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:02:11,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:02:11,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:02:11,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:02:11,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:02:11,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:02:11,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:02:11,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (1/1) ... [2024-11-08 23:02:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:02:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:02:11,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:02:11,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:02:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:02:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:02:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:02:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:02:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:02:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:02:11,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:02:11,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:02:12,423 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:02:12,424 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:02:12,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:02:12,435 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:02:12,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:12 BoogieIcfgContainer [2024-11-08 23:02:12,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:02:12,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:02:12,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:02:12,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:02:12,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:02:11" (1/3) ... [2024-11-08 23:02:12,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717b1ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:02:12, skipping insertion in model container [2024-11-08 23:02:12,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:11" (2/3) ... [2024-11-08 23:02:12,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717b1ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:02:12, skipping insertion in model container [2024-11-08 23:02:12,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:12" (3/3) ... [2024-11-08 23:02:12,445 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-67.i [2024-11-08 23:02:12,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:02:12,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:02:12,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:02:12,521 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;@98b025e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:02:12,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:02:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:02:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:02:12,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:02:12,532 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:02:12,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:02:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2110773757, now seen corresponding path program 1 times [2024-11-08 23:02:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:02:12,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077984617] [2024-11-08 23:02:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:12,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:02:12,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:02:12,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:02:12,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:02:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:12,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:02:12,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:02:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-08 23:02:12,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:02:12,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:02:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077984617] [2024-11-08 23:02:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077984617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:02:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:02:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:02:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261428056] [2024-11-08 23:02:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:02:12,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:02:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:02:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:02:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:02:12,833 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:02:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:02:12,860 INFO L93 Difference]: Finished difference Result 81 states and 132 transitions. [2024-11-08 23:02:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:02:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-11-08 23:02:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:02:12,870 INFO L225 Difference]: With dead ends: 81 [2024-11-08 23:02:12,870 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 23:02:12,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:02:12,877 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:02:12,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:02:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 23:02:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 23:02:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:02:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-08 23:02:12,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2024-11-08 23:02:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:02:12,916 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-08 23:02:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:02:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-08 23:02:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:02:12,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:02:12,919 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:02:12,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:02:13,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:02:13,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:02:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash -245825215, now seen corresponding path program 1 times [2024-11-08 23:02:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:02:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758232508] [2024-11-08 23:02:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:02:13,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:02:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:02:13,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:02:13,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:02:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:13,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 23:02:13,312 INFO L278 TraceCheckSpWp]: Computing forward predicates...