./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-68.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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:41:45,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:41:45,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:41:45,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:41:45,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:41:45,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:41:45,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:41:45,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:41:45,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:41:45,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:41:45,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:41:45,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:41:45,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:41:45,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:41:45,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:41:45,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:41:45,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:41:45,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:41:45,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:41:45,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:41:45,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:41:45,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:41:45,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:41:45,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:41:45,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:41:45,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:41:45,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:41:45,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:41:45,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:41:45,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:41:45,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:41:45,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:41:45,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:41:45,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:41:45,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:41:45,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:41:45,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:41:45,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:41:45,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:41:45,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:41:45,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:41:45,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:41:45,555 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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2024-11-16 15:41:45,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:41:45,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:41:45,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:41:45,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:41:45,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:41:45,791 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-68.i [2024-11-16 15:41:47,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:41:47,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:41:47,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2024-11-16 15:41:47,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a72d9e1/5b2ee19f50054375937ce5149747f62c/FLAG7d531ec35 [2024-11-16 15:41:47,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a72d9e1/5b2ee19f50054375937ce5149747f62c [2024-11-16 15:41:47,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:41:47,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:41:47,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:41:47,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:41:47,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:41:47,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69813581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47, skipping insertion in model container [2024-11-16 15:41:47,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:41:47,770 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-68.i[917,930] [2024-11-16 15:41:47,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:41:47,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:41:47,820 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-68.i[917,930] [2024-11-16 15:41:47,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:41:47,853 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:41:47,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47 WrapperNode [2024-11-16 15:41:47,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:41:47,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:41:47,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:41:47,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:41:47,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,885 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-16 15:41:47,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:41:47,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:41:47,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:41:47,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:41:47,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,912 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-16 15:41:47,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:41:47,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:41:47,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:41:47,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:41:47,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (1/1) ... [2024-11-16 15:41:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:41:47,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:41:47,951 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-16 15:41:47,955 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-16 15:41:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:41:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:41:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:41:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:41:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:41:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:41:48,052 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:41:48,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:41:48,283 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:41:48,289 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:41:48,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:41:48,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:41:48,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:41:48 BoogieIcfgContainer [2024-11-16 15:41:48,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:41:48,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:41:48,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:41:48,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:41:48,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:41:47" (1/3) ... [2024-11-16 15:41:48,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@961d453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:41:48, skipping insertion in model container [2024-11-16 15:41:48,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:47" (2/3) ... [2024-11-16 15:41:48,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@961d453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:41:48, skipping insertion in model container [2024-11-16 15:41:48,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:41:48" (3/3) ... [2024-11-16 15:41:48,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2024-11-16 15:41:48,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:41:48,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:41:48,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:41:48,404 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;@53fa6cfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:41:48,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:41:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:48,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:48,421 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:48,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:48,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash -632268491, now seen corresponding path program 1 times [2024-11-16 15:41:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:41:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613056039] [2024-11-16 15:41:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:41:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:41:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 15:41:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 15:41:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 15:41:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:41:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:41:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:41:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:41:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:41:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:41:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:41:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 15:41:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:41:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 15:41:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:41:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:41:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:41:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 15:41:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:41:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613056039] [2024-11-16 15:41:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613056039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:41:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:41:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:41:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274555107] [2024-11-16 15:41:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:41:48,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:41:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:41:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:41:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:41:48,815 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 15:41:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:41:48,841 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2024-11-16 15:41:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:41:48,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-16 15:41:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:41:48,850 INFO L225 Difference]: With dead ends: 106 [2024-11-16 15:41:48,851 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 15:41:48,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-16 15:41:48,859 INFO L432 NwaCegarLoop]: 74 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, 74 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-16 15:41:48,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:41:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 15:41:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 15:41:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-16 15:41:48,910 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 112 [2024-11-16 15:41:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:41:48,911 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-16 15:41:48,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 15:41:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-16 15:41:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:48,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:48,917 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:48,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:41:48,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 626001492, now seen corresponding path program 1 times [2024-11-16 15:41:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:41:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020225280] [2024-11-16 15:41:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:41:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:41:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 15:41:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 15:41:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 15:41:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:41:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:41:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:41:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:41:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:41:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:41:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 15:41:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:41:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 15:41:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:41:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:41:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:41:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 15:41:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:41:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020225280] [2024-11-16 15:41:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020225280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:41:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:41:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:41:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394482514] [2024-11-16 15:41:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:41:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:41:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:41:49,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:41:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:41:49,266 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 15:41:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:41:49,297 INFO L93 Difference]: Finished difference Result 101 states and 145 transitions. [2024-11-16 15:41:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:41:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-16 15:41:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:41:49,300 INFO L225 Difference]: With dead ends: 101 [2024-11-16 15:41:49,300 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 15:41:49,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:41:49,302 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:41:49,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:41:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 15:41:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 15:41:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2024-11-16 15:41:49,314 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 112 [2024-11-16 15:41:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:41:49,317 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2024-11-16 15:41:49,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 15:41:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2024-11-16 15:41:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:49,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:49,319 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:49,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:41:49,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:49,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1181452971, now seen corresponding path program 1 times [2024-11-16 15:41:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:41:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873313668] [2024-11-16 15:41:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:41:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:41:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129343214] [2024-11-16 15:41:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:41:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:41:49,440 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-16 15:41:49,443 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-16 15:41:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:41:49,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:41:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:41:49,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:41:49,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:41:49,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:41:49,755 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-16 15:41:49,946 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-16 15:41:49,949 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:41:50,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:41:50,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:41:50 BoogieIcfgContainer [2024-11-16 15:41:50,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:41:50,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:41:50,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:41:50,040 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:41:50,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:41:48" (3/4) ... [2024-11-16 15:41:50,044 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:41:50,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:41:50,046 INFO L158 Benchmark]: Toolchain (without parser) took 2439.97ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 111.3MB in the beginning and 85.8MB in the end (delta: 25.5MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,048 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:41:50,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.91ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 96.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,049 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,049 INFO L158 Benchmark]: IcfgBuilder took 384.10ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 75.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,049 INFO L158 Benchmark]: TraceAbstraction took 1732.85ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 74.7MB in the beginning and 86.8MB in the end (delta: -12.1MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,049 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 222.3MB. Free memory was 86.8MB in the beginning and 85.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:41:50,051 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.19ms. Allocated memory is still 167.8MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.91ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 96.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 384.10ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 75.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1732.85ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 74.7MB in the beginning and 86.8MB in the end (delta: -12.1MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 222.3MB. Free memory was 86.8MB in the beginning and 85.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] unsigned char var_1_9 = 0; [L27] double var_1_10 = 25.5; [L28] double var_1_11 = 999999999.729; [L29] double var_1_12 = 999.8; [L30] signed short int var_1_13 = -25; [L31] signed short int var_1_14 = -64; [L32] signed short int var_1_15 = 0; [L33] signed short int var_1_16 = -8; [L34] signed long int var_1_17 = 5; [L35] unsigned long int var_1_18 = 0; [L36] unsigned long int var_1_19 = 8; [L37] float var_1_20 = 32.375; [L38] signed long int var_1_21 = -10; [L39] signed short int last_1_var_1_13 = -25; [L40] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L103] last_1_var_1_13 = var_1_13 [L104] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L75] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L76] var_1_3 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L77] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L78] var_1_8 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && 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_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && 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_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_14 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 8192) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L92] var_1_15 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_15 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 <= 8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_16 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= -16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L98] var_1_19 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L115] RET updateVariables() [L116] CALL step() [L44] signed long int stepLocal_2 = var_1_8 + last_1_var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L45] COND FALSE !(\read(var_1_9)) [L52] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L54] var_1_17 = (var_1_13 + var_1_14) [L55] var_1_18 = var_1_19 [L56] var_1_20 = var_1_12 [L57] var_1_21 = var_1_17 [L58] signed long int stepLocal_1 = var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_1=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L59] COND FALSE !(stepLocal_1 != var_1_21) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L62] unsigned long int stepLocal_0 = var_1_18 + var_1_21; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L63] COND TRUE (var_1_2 - var_1_3) >= var_1_10 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L64] COND TRUE stepLocal_0 >= (var_1_13 / var_1_8) [L65] var_1_1 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((((((var_1_2 - var_1_3) >= var_1_10) ? (((var_1_18 + var_1_21) >= (var_1_13 / var_1_8)) ? (var_1_1 == ((signed long int) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : 1) : (var_1_9 ? (var_1_1 == ((signed long int) ((((var_1_21) > (var_1_18)) ? (var_1_21) : (var_1_18))))) : 1)) && ((var_1_17 != var_1_21) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1)) && (var_1_9 ? ((last_1_var_1_13 <= (var_1_8 + last_1_var_1_17)) ? (var_1_13 == ((signed short int) ((var_1_14 + var_1_15) + var_1_16))) : (var_1_13 == ((signed short int) var_1_15))) : (var_1_13 == ((signed short int) var_1_15)))) && (var_1_17 == ((signed long int) (var_1_13 + var_1_14)))) && (var_1_18 == ((unsigned long int) var_1_19))) && (var_1_20 == ((float) var_1_12))) && (var_1_21 == ((signed long int) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 146 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 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-16 15:41:50,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:41:52,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:41:52,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:41:52,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:41:52,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:41:52,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:41:52,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:41:52,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:41:52,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:41:52,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:41:52,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:41:52,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:41:52,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:41:52,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:41:52,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:41:52,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:41:52,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:41:52,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:41:52,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:41:52,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:41:52,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:41:52,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:41:52,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:41:52,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:41:52,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:41:52,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:41:52,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:41:52,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:41:52,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:41:52,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:41:52,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:41:52,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:41:52,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:41:52,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:41:52,367 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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2024-11-16 15:41:52,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:41:52,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:41:52,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:41:52,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:41:52,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:41:52,717 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-68.i [2024-11-16 15:41:53,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:41:54,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:41:54,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2024-11-16 15:41:54,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7dc52288/415b34cf93c849feb5af69b8f0953852/FLAG8a57f6def [2024-11-16 15:41:54,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7dc52288/415b34cf93c849feb5af69b8f0953852 [2024-11-16 15:41:54,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:41:54,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:41:54,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:41:54,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:41:54,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:41:54,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd97a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54, skipping insertion in model container [2024-11-16 15:41:54,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:41:54,712 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-68.i[917,930] [2024-11-16 15:41:54,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:41:54,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:41:54,790 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-68.i[917,930] [2024-11-16 15:41:54,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:41:54,836 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:41:54,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54 WrapperNode [2024-11-16 15:41:54,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:41:54,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:41:54,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:41:54,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:41:54,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,890 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 15:41:54,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:41:54,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:41:54,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:41:54,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:41:54,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,925 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-16 15:41:54,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:41:54,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:41:54,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:41:54,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:41:54,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (1/1) ... [2024-11-16 15:41:54,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:41:54,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:41:54,984 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-16 15:41:54,989 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-16 15:41:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:41:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:41:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:41:55,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:41:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:41:55,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:41:55,105 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:41:55,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:41:57,079 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:41:57,079 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:41:57,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:41:57,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:41:57,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:41:57 BoogieIcfgContainer [2024-11-16 15:41:57,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:41:57,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:41:57,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:41:57,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:41:57,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:41:54" (1/3) ... [2024-11-16 15:41:57,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6510b999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:41:57, skipping insertion in model container [2024-11-16 15:41:57,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:41:54" (2/3) ... [2024-11-16 15:41:57,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6510b999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:41:57, skipping insertion in model container [2024-11-16 15:41:57,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:41:57" (3/3) ... [2024-11-16 15:41:57,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2024-11-16 15:41:57,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:41:57,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:41:57,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:41:57,171 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;@4cfa3d81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:41:57,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:41:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:57,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:57,183 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:57,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:57,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash -632268491, now seen corresponding path program 1 times [2024-11-16 15:41:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:41:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062763087] [2024-11-16 15:41:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:57,198 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-16 15:41:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:41:57,200 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-16 15:41:57,222 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-16 15:41:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:57,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:41:57,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:41:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-16 15:41:57,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:41:57,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:41:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062763087] [2024-11-16 15:41:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062763087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:41:57,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:41:57,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:41:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715525235] [2024-11-16 15:41:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:41:57,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:41:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:41:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:41:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:41:57,541 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 15:41:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:41:57,558 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2024-11-16 15:41:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:41:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-16 15:41:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:41:57,568 INFO L225 Difference]: With dead ends: 106 [2024-11-16 15:41:57,568 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 15:41:57,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-16 15:41:57,573 INFO L432 NwaCegarLoop]: 74 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, 74 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-16 15:41:57,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:41:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 15:41:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 15:41:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-16 15:41:57,612 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 112 [2024-11-16 15:41:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:41:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-16 15:41:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 15:41:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-16 15:41:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:57,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:57,615 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:57,627 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-16 15:41:57,816 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-16 15:41:57,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash 626001492, now seen corresponding path program 1 times [2024-11-16 15:41:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:41:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739116260] [2024-11-16 15:41:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:57,820 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-16 15:41:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:41:57,824 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-16 15:41:57,825 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-16 15:41:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:41:58,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 15:41:58,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:41:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 15:41:58,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:41:58,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:41:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739116260] [2024-11-16 15:41:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739116260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:41:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:41:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:41:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511517742] [2024-11-16 15:41:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:41:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:41:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:41:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:41:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:41:58,164 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 15:41:59,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:41:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:41:59,730 INFO L93 Difference]: Finished difference Result 101 states and 145 transitions. [2024-11-16 15:41:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:41:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-16 15:41:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:41:59,758 INFO L225 Difference]: With dead ends: 101 [2024-11-16 15:41:59,758 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 15:41:59,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:41:59,759 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:41:59,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 15:41:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 15:41:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 15:41:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:41:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2024-11-16 15:41:59,767 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 112 [2024-11-16 15:41:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:41:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2024-11-16 15:41:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 15:41:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2024-11-16 15:41:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 15:41:59,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:41:59,771 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:41:59,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 15:41:59,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:41:59,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:41:59,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:41:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1181452971, now seen corresponding path program 1 times [2024-11-16 15:41:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:41:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75959566] [2024-11-16 15:41:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:41:59,975 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-16 15:41:59,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:41:59,981 INFO L229 MonitoredProcess]: Starting monitored process 4 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-16 15:41:59,982 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 (4)] Waiting until timeout for monitored process [2024-11-16 15:42:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:42:00,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 15:42:00,270 INFO L278 TraceCheckSpWp]: Computing forward predicates...