./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_no-floats_file-25.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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:51:19,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:51:19,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:51:19,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:51:19,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:51:19,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:51:19,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:51:19,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:51:19,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:51:19,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:51:19,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:51:19,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:51:19,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:51:19,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:51:19,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:51:19,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:51:19,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:51:19,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:51:19,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:51:19,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:51:19,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:51:19,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:51:19,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:51:19,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:51:19,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:51:19,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:51:19,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:51:19,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:51:19,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:51:19,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:51:19,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:51:19,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:19,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:51:19,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:51:19,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:51:19,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:51:19,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:51:19,688 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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2024-11-10 06:51:19,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:51:19,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:51:19,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:51:19,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:51:19,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:51:19,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:21,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:51:21,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:51:21,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:21,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71649d7a/c16baf77f1f64feda07f56461cc4d05d/FLAG6c892d07d [2024-11-10 06:51:21,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71649d7a/c16baf77f1f64feda07f56461cc4d05d [2024-11-10 06:51:21,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:51:21,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:51:21,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:21,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:51:21,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:51:21,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:21,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301d4e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21, skipping insertion in model container [2024-11-10 06:51:21,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:21,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:51:21,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-11-10 06:51:21,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:21,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:51:21,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-11-10 06:51:21,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:21,958 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:51:21,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21 WrapperNode [2024-11-10 06:51:21,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:21,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:21,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:51:21,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:51:21,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:21,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:21,993 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-10 06:51:21,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:21,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:51:21,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:51:21,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:51:22,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,023 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-10 06:51:22,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:51:22,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:51:22,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:51:22,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:51:22,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (1/1) ... [2024-11-10 06:51:22,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:22,071 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-10 06:51:22,074 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-10 06:51:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:51:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:51:22,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:51:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:51:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:51:22,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:51:22,181 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:51:22,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:51:22,473 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:51:22,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:51:22,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:51:22,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:51:22,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:22 BoogieIcfgContainer [2024-11-10 06:51:22,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:51:22,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:51:22,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:51:22,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:51:22,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:21" (1/3) ... [2024-11-10 06:51:22,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99c15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:22, skipping insertion in model container [2024-11-10 06:51:22,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:21" (2/3) ... [2024-11-10 06:51:22,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99c15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:22, skipping insertion in model container [2024-11-10 06:51:22,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:22" (3/3) ... [2024-11-10 06:51:22,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:22,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:51:22,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:51:22,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:51:22,555 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;@4adaa533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:51:22,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:51:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:51:22,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:22,567 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:22,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:22,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash 781191785, now seen corresponding path program 1 times [2024-11-10 06:51:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:51:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165317919] [2024-11-10 06:51:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:51:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:51:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:51:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:51:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:51:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:51:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:51:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:51:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:51:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:51:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:51:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:51:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:51:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:51:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:51:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:51:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:51:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:51:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:51:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:51:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:51:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 06:51:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:51:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165317919] [2024-11-10 06:51:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165317919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:51:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418022425] [2024-11-10 06:51:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:22,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:51:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:51:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:51:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:22,871 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:22,891 INFO L93 Difference]: Finished difference Result 114 states and 193 transitions. [2024-11-10 06:51:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:51:22,893 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-10 06:51:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:22,898 INFO L225 Difference]: With dead ends: 114 [2024-11-10 06:51:22,898 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 06:51:22,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:22,903 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:22,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:51:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 06:51:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 06:51:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-11-10 06:51:22,935 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 127 [2024-11-10 06:51:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:22,935 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-11-10 06:51:22,935 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-11-10 06:51:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:51:22,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:22,938 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:22,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:51:22,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1468716649, now seen corresponding path program 1 times [2024-11-10 06:51:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:51:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843705892] [2024-11-10 06:51:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:51:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:51:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:51:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:51:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:51:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:51:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:51:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:51:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:51:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:51:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:51:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:51:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:51:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:51:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:51:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:51:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:51:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:51:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:51:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:51:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:51:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 06:51:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:51:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843705892] [2024-11-10 06:51:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843705892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:51:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879499715] [2024-11-10 06:51:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:23,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:51:23,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:23,519 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-10 06:51:23,520 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-10 06:51:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:23,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 06:51:23,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 06:51:23,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:51:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879499715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 06:51:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-10 06:51:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36150165] [2024-11-10 06:51:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:51:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:51:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:51:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:51:23,765 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:24,071 INFO L93 Difference]: Finished difference Result 119 states and 169 transitions. [2024-11-10 06:51:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:51:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-10 06:51:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:24,073 INFO L225 Difference]: With dead ends: 119 [2024-11-10 06:51:24,073 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 06:51:24,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-10 06:51:24,075 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:24,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 189 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:51:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 06:51:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 06:51:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-11-10 06:51:24,086 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 127 [2024-11-10 06:51:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:24,087 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-11-10 06:51:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-10 06:51:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:51:24,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:24,089 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:24,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:51:24,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:51:24,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:24,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -947187233, now seen corresponding path program 1 times [2024-11-10 06:51:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:51:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407837377] [2024-11-10 06:51:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:51:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:24,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:51:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:24,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:51:24,508 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:51:24,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:51:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:51:24,514 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:51:24,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:51:24,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:51:24 BoogieIcfgContainer [2024-11-10 06:51:24,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:51:24,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:51:24,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:51:24,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:51:24,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:22" (3/4) ... [2024-11-10 06:51:24,595 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:51:24,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:51:24,597 INFO L158 Benchmark]: Toolchain (without parser) took 2900.45ms. Allocated memory is still 176.2MB. Free memory was 109.5MB in the beginning and 127.1MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:24,599 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 74.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:24,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.99ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 94.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:51:24,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.87ms. Allocated memory is still 176.2MB. Free memory was 94.7MB in the beginning and 92.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:51:24,599 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:51:24,600 INFO L158 Benchmark]: IcfgBuilder took 448.35ms. Allocated memory is still 176.2MB. Free memory was 89.5MB in the beginning and 140.9MB in the end (delta: -51.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:51:24,600 INFO L158 Benchmark]: TraceAbstraction took 2106.83ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 127.1MB in the end (delta: 13.0MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-11-10 06:51:24,600 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 176.2MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:24,604 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 74.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.99ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 94.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.87ms. Allocated memory is still 176.2MB. Free memory was 94.7MB in the beginning and 92.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 448.35ms. Allocated memory is still 176.2MB. Free memory was 89.5MB in the beginning and 140.9MB in the end (delta: -51.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2106.83ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 127.1MB in the end (delta: 13.0MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 176.2MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; VAL [isInitial=0, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=63] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=63] [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L97] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L97] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L99] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L100] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L100] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4294967296, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=4294967296, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=4294967296, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=4294967296, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=4294967296, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=128, var_1_9=-1] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_9=-1] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_9=-1] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=4294967297, var_1_9=-1] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=4294967297, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4294967296, var_1_2=0, var_1_3=4294967296, var_1_4=0, var_1_5=0, var_1_6=-3221225473, var_1_7=-7516192769, var_1_8=4294967297, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 136 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 509 NumberOfCodeBlocks, 509 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 488 SizeOfPredicates, 1 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2277/2280 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-10 06:51:24,629 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_no-floats_file-25.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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:51:26,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:51:26,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:51:26,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:51:26,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:51:26,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:51:26,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:51:26,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:51:26,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:51:26,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:51:26,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:51:26,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:51:26,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:51:26,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:51:26,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:51:26,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:51:26,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:51:26,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:51:26,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:51:26,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:51:26,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:51:26,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:51:26,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:51:26,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:51:26,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:51:26,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:51:26,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:51:26,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:51:26,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:51:26,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:51:26,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:51:26,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:51:26,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:51:26,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:51:26,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:26,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:51:26,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:51:26,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:51:26,569 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:51:26,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:51:26,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:51:26,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:51:26,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:51:26,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:51:26,570 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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2024-11-10 06:51:26,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:51:26,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:51:26,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:51:26,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:51:26,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:51:26,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:28,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:51:28,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:51:28,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:28,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0071fd0d7/5a9096f1499747d781fbc2374ce9cb52/FLAG0a4a29c47 [2024-11-10 06:51:28,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0071fd0d7/5a9096f1499747d781fbc2374ce9cb52 [2024-11-10 06:51:28,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:51:28,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:51:28,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:28,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:51:28,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:51:28,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff7ea5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28, skipping insertion in model container [2024-11-10 06:51:28,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:51:28,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-11-10 06:51:28,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:28,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:51:28,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-11-10 06:51:28,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:28,716 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:51:28,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28 WrapperNode [2024-11-10 06:51:28,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:28,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:28,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:51:28,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:51:28,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,760 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-10 06:51:28,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:28,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:51:28,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:51:28,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:51:28,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,790 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-10 06:51:28,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:51:28,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:51:28,813 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:51:28,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:51:28,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (1/1) ... [2024-11-10 06:51:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:28,842 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-10 06:51:28,844 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-10 06:51:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:51:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:51:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:51:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:51:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:51:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:51:28,937 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:51:28,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:51:31,400 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:51:31,400 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:51:31,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:51:31,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:51:31,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:31 BoogieIcfgContainer [2024-11-10 06:51:31,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:51:31,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:51:31,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:51:31,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:51:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:28" (1/3) ... [2024-11-10 06:51:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3598bcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:31, skipping insertion in model container [2024-11-10 06:51:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:28" (2/3) ... [2024-11-10 06:51:31,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3598bcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:31, skipping insertion in model container [2024-11-10 06:51:31,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:31" (3/3) ... [2024-11-10 06:51:31,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-10 06:51:31,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:51:31,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:51:31,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:51:31,485 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;@fbe37cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:51:31,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:51:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:51:31,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:31,518 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:31,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 781191785, now seen corresponding path program 1 times [2024-11-10 06:51:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:31,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451787171] [2024-11-10 06:51:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:31,538 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-10 06:51:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:31,541 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-10 06:51:31,542 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-10 06:51:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:31,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:51:31,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-10 06:51:31,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:51:31,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:51:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451787171] [2024-11-10 06:51:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451787171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:31,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:51:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831532658] [2024-11-10 06:51:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:31,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:51:31,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:51:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:51:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:31,751 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:31,770 INFO L93 Difference]: Finished difference Result 114 states and 193 transitions. [2024-11-10 06:51:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:51:31,771 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-10 06:51:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:31,777 INFO L225 Difference]: With dead ends: 114 [2024-11-10 06:51:31,778 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 06:51:31,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-10 06:51:31,786 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:31,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:51:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 06:51:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 06:51:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-11-10 06:51:31,820 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 127 [2024-11-10 06:51:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-11-10 06:51:31,820 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-11-10 06:51:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:51:31,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:31,826 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:31,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:51:32,027 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-10 06:51:32,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1468716649, now seen corresponding path program 1 times [2024-11-10 06:51:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811903991] [2024-11-10 06:51:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:32,029 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-10 06:51:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:32,030 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-10 06:51:32,031 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-10 06:51:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:32,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:51:32,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 06:51:32,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:51:32,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:51:32,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811903991] [2024-11-10 06:51:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811903991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:51:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676482106] [2024-11-10 06:51:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:51:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:51:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:51:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:51:32,414 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:33,500 INFO L93 Difference]: Finished difference Result 119 states and 169 transitions. [2024-11-10 06:51:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:51:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-10 06:51:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:33,519 INFO L225 Difference]: With dead ends: 119 [2024-11-10 06:51:33,519 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 06:51:33,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-10 06:51:33,520 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:33,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 159 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 06:51:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 06:51:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 06:51:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 06:51:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-11-10 06:51:33,535 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 127 [2024-11-10 06:51:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:33,536 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-11-10 06:51:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 06:51:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-10 06:51:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:51:33,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:33,537 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:51:33,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:51:33,738 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-10 06:51:33,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -947187233, now seen corresponding path program 1 times [2024-11-10 06:51:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95520292] [2024-11-10 06:51:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:33,742 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-10 06:51:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:33,745 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-10 06:51:33,746 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-10 06:51:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:33,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:51:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:33,968 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-10 06:51:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [272200792] [2024-11-10 06:51:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:33,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:51:33,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:51:33,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:51:33,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 06:51:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:34,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 06:51:34,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:52:20,120 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)