./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.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 cb070cbac56f4132adf0ae0dc3c895d175df689a74443e8769847a39a55ce89b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:41:40,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:41:40,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:41:40,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:41:40,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:41:40,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:41:40,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:41:40,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:41:40,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:41:40,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:41:40,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:41:40,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:41:40,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:41:40,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:41:40,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:41:40,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:41:40,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:41:40,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:41:40,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:41:40,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:41:40,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:41:40,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:41:40,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:41:40,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:41:40,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:41:40,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:41:40,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:41:40,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:41:40,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:41:40,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:41:40,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:41:40,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:41:40,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:41:40,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:41:40,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:41:40,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:41:40,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:41:40,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:41:40,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:41:40,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:41:40,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:41:40,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:41:40,157 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 -> cb070cbac56f4132adf0ae0dc3c895d175df689a74443e8769847a39a55ce89b [2024-11-22 10:41:40,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:41:40,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:41:40,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:41:40,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:41:40,416 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:41:40,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:41,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:41:41,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:41:41,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:41,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f6ca7c/6189e256e52e4fcfa7845e83bd3b0e56/FLAG21bce83be [2024-11-22 10:41:42,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f6ca7c/6189e256e52e4fcfa7845e83bd3b0e56 [2024-11-22 10:41:42,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:41:42,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:41:42,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:42,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:41:42,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:41:42,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6767b32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42, skipping insertion in model container [2024-11-22 10:41:42,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:41:42,583 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_loopvsstraightlinecode_25-1loop_file-52.i[915,928] [2024-11-22 10:41:42,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:42,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:41:42,651 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_loopvsstraightlinecode_25-1loop_file-52.i[915,928] [2024-11-22 10:41:42,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:42,690 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:41:42,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42 WrapperNode [2024-11-22 10:41:42,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:42,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:42,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:41:42,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:41:42,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,748 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-22 10:41:42,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:42,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:41:42,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:41:42,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:41:42,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,814 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-22 10:41:42,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:41:42,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:41:42,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:41:42,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:41:42,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (1/1) ... [2024-11-22 10:41:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:41:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:41:42,917 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-22 10:41:42,919 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-22 10:41:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:41:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:41:42,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:41:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:41:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:41:42,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:41:43,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:41:43,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:41:43,292 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-22 10:41:43,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:41:43,307 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:41:43,307 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:41:43,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:43 BoogieIcfgContainer [2024-11-22 10:41:43,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:41:43,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:41:43,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:41:43,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:41:43,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:41:42" (1/3) ... [2024-11-22 10:41:43,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edd063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:43, skipping insertion in model container [2024-11-22 10:41:43,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:42" (2/3) ... [2024-11-22 10:41:43,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edd063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:43, skipping insertion in model container [2024-11-22 10:41:43,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:43" (3/3) ... [2024-11-22 10:41:43,318 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:43,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:41:43,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:41:43,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:41:43,405 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;@1bd624dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:41:43,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:41:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:41:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 10:41:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:43,419 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:41:43,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:43,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1649595466, now seen corresponding path program 1 times [2024-11-22 10:41:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:41:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503286963] [2024-11-22 10:41:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:41:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-22 10:41:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:41:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503286963] [2024-11-22 10:41:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503286963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:41:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637568664] [2024-11-22 10:41:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:44,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:41:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:41:44,501 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-22 10:41:44,503 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-22 10:41:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:44,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 10:41:44,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:41:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-22 10:41:45,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:41:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-22 10:41:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637568664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:41:45,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:41:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 17 [2024-11-22 10:41:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679373120] [2024-11-22 10:41:45,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:41:45,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 10:41:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:41:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 10:41:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-22 10:41:45,475 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-22 10:41:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:41:46,696 INFO L93 Difference]: Finished difference Result 228 states and 378 transitions. [2024-11-22 10:41:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-22 10:41:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 113 [2024-11-22 10:41:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:41:46,710 INFO L225 Difference]: With dead ends: 228 [2024-11-22 10:41:46,710 INFO L226 Difference]: Without dead ends: 166 [2024-11-22 10:41:46,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=461, Invalid=1345, Unknown=0, NotChecked=0, Total=1806 [2024-11-22 10:41:46,720 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 196 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:41:46,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 388 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 10:41:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-22 10:41:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 111. [2024-11-22 10:41:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:41:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 147 transitions. [2024-11-22 10:41:46,804 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 147 transitions. Word has length 113 [2024-11-22 10:41:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:41:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 147 transitions. [2024-11-22 10:41:46,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-22 10:41:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 147 transitions. [2024-11-22 10:41:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 10:41:46,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:46,809 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:41:46,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:41:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:41:47,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash -840248840, now seen corresponding path program 1 times [2024-11-22 10:41:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:41:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019154226] [2024-11-22 10:41:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:41:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:41:47,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:41:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:41:47,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:41:47,195 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:41:47,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:41:47,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:41:47,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 10:41:47,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:41:47,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:41:47 BoogieIcfgContainer [2024-11-22 10:41:47,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:41:47,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:41:47,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:41:47,270 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:41:47,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:43" (3/4) ... [2024-11-22 10:41:47,273 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:41:47,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:41:47,276 INFO L158 Benchmark]: Toolchain (without parser) took 4900.60ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 118.4MB in the beginning and 135.7MB in the end (delta: -17.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,277 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:41:47,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.43ms. Allocated memory is still 186.6MB. Free memory was 118.1MB in the beginning and 103.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.09ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 100.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,279 INFO L158 Benchmark]: Boogie Preprocessor took 128.55ms. Allocated memory is still 186.6MB. Free memory was 100.6MB in the beginning and 153.9MB in the end (delta: -53.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,279 INFO L158 Benchmark]: RCFGBuilder took 429.64ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 136.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,280 INFO L158 Benchmark]: TraceAbstraction took 3958.32ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 135.8MB in the beginning and 136.7MB in the end (delta: -994.9kB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,280 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 241.2MB. Free memory was 136.7MB in the beginning and 135.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:41:47,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.43ms. Allocated memory is still 186.6MB. Free memory was 118.1MB in the beginning and 103.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.09ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 100.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.55ms. Allocated memory is still 186.6MB. Free memory was 100.6MB in the beginning and 153.9MB in the end (delta: -53.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 429.64ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 136.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3958.32ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 135.8MB in the beginning and 136.7MB in the end (delta: -994.9kB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 241.2MB. Free memory was 136.7MB in the beginning and 135.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] double var_1_2 = 255.6; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 8; [L29] double var_1_10 = 255.2; [L30] unsigned char var_1_11 = 64; [L31] unsigned char var_1_12 = 100; [L32] unsigned char var_1_13 = 32; [L33] unsigned char var_1_14 = 64; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_2=1278/5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L96] isInitial = 1 [L97] FCALL initially() [L98] int k_loop; [L99] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_2=1278/5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L99] COND TRUE k_loop < 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L62] var_1_6 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L66] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L68] var_1_8 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L69] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L70] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L70] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L71] var_1_10 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L72] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L74] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L77] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L101] RET updateVariables() [L102] CALL step() [L38] COND TRUE (- var_1_2) <= var_1_10 [L39] var_1_9 = ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L43] COND TRUE var_1_2 < 63.75 [L44] var_1_1 = (10 - var_1_9) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L48] signed long int stepLocal_0 = (var_1_9 / -256) * 32; VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L49] COND FALSE !(var_1_9 > stepLocal_0) [L56] var_1_5 = var_1_7 VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L102] RET step() [L103] CALL, EXPR property() [L92-L93] return (((var_1_2 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_9))) : (var_1_1 == ((signed short int) (4 + var_1_9)))) && ((var_1_9 > ((var_1_9 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && (! var_1_8))))) : (var_1_5 == ((unsigned char) var_1_7))) : (var_1_5 == ((unsigned char) var_1_7)))) && (((- var_1_2) <= var_1_10) ? (var_1_9 == ((unsigned char) ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))))) : (var_1_9 == ((unsigned char) var_1_12))) ; VAL [\result=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 90 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=1, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 SizeOfPredicates, 3 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 1758/1836 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-22 10:41:47,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.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 cb070cbac56f4132adf0ae0dc3c895d175df689a74443e8769847a39a55ce89b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:41:49,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:41:49,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:41:49,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:41:49,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:41:49,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:41:49,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:41:49,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:41:49,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:41:49,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:41:49,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:41:49,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:41:49,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:41:49,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:41:49,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:41:49,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:41:49,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:41:49,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:41:49,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:41:49,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:41:49,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:41:49,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:41:49,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:41:49,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:41:49,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:41:49,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:41:49,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:41:49,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:41:49,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:41:49,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:41:49,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:41:49,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:41:49,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:41:49,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:41:49,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:41:49,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:41:49,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:41:49,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:41:49,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:41:49,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:41:49,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:41:49,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:41:49,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:41:49,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:41:49,680 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 -> cb070cbac56f4132adf0ae0dc3c895d175df689a74443e8769847a39a55ce89b [2024-11-22 10:41:50,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:41:50,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:41:50,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:41:50,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:41:50,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:41:50,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:51,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:41:51,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:41:51,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:51,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ec722a2/02834064c69a4fb589995c35615a886d/FLAG1e963a434 [2024-11-22 10:41:51,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ec722a2/02834064c69a4fb589995c35615a886d [2024-11-22 10:41:51,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:41:51,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:41:51,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:51,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:41:51,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:41:51,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:51" (1/1) ... [2024-11-22 10:41:51,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c9f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:51, skipping insertion in model container [2024-11-22 10:41:51,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:51" (1/1) ... [2024-11-22 10:41:51,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:41:52,060 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_loopvsstraightlinecode_25-1loop_file-52.i[915,928] [2024-11-22 10:41:52,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:52,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:41:52,152 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_loopvsstraightlinecode_25-1loop_file-52.i[915,928] [2024-11-22 10:41:52,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:52,198 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:41:52,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52 WrapperNode [2024-11-22 10:41:52,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:52,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:52,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:41:52,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:41:52,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,247 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-22 10:41:52,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:52,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:41:52,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:41:52,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:41:52,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,282 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-22 10:41:52,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:41:52,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:41:52,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:41:52,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:41:52,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (1/1) ... [2024-11-22 10:41:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:41:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:41:52,340 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-22 10:41:52,345 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-22 10:41:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:41:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:41:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:41:52,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:41:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:41:52,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:41:52,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:41:52,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:41:52,737 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-22 10:41:52,737 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:41:52,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:41:52,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:41:52,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:52 BoogieIcfgContainer [2024-11-22 10:41:52,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:41:52,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:41:52,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:41:52,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:41:52,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:41:51" (1/3) ... [2024-11-22 10:41:52,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7195d361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:52, skipping insertion in model container [2024-11-22 10:41:52,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:52" (2/3) ... [2024-11-22 10:41:52,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7195d361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:52, skipping insertion in model container [2024-11-22 10:41:52,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:52" (3/3) ... [2024-11-22 10:41:52,768 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-52.i [2024-11-22 10:41:52,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:41:52,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:41:52,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:41:52,865 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;@1344749f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:41:52,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:41:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:41:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 10:41:52,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:52,884 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:41:52,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1649595466, now seen corresponding path program 1 times [2024-11-22 10:41:52,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:41:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305292509] [2024-11-22 10:41:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:52,907 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-22 10:41:52,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:41:52,911 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-22 10:41:52,912 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-22 10:41:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:53,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 10:41:53,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:41:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-22 10:41:53,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:41:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-22 10:41:53,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:41:53,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305292509] [2024-11-22 10:41:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305292509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:41:53,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:41:53,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-22 10:41:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161041718] [2024-11-22 10:41:53,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 10:41:53,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:41:53,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:41:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:41:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:41:53,982 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-22 10:41:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:41:55,174 INFO L93 Difference]: Finished difference Result 222 states and 371 transitions. [2024-11-22 10:41:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 10:41:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 113 [2024-11-22 10:41:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:41:55,189 INFO L225 Difference]: With dead ends: 222 [2024-11-22 10:41:55,189 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 10:41:55,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 10:41:55,196 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 121 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:41:55,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 370 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 10:41:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 10:41:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 60. [2024-11-22 10:41:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:41:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2024-11-22 10:41:55,258 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 113 [2024-11-22 10:41:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:41:55,261 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2024-11-22 10:41:55,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-22 10:41:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2024-11-22 10:41:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 10:41:55,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:55,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:41:55,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 10:41:55,468 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-22 10:41:55,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -840248840, now seen corresponding path program 1 times [2024-11-22 10:41:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:41:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430409124] [2024-11-22 10:41:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:55,471 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-22 10:41:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:41:55,474 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-22 10:41:55,476 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-22 10:41:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:55,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:41:55,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:42:05,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:42:05,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430409124] [2024-11-22 10:42:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430409124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:05,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:42:05,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:42:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809639155] [2024-11-22 10:42:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:05,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:42:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:05,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:42:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:42:05,603 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:06,296 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2024-11-22 10:42:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:42:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-22 10:42:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:06,301 INFO L225 Difference]: With dead ends: 91 [2024-11-22 10:42:06,304 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 10:42:06,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:42:06,306 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:06,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 351 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 10:42:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 10:42:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2024-11-22 10:42:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:42:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-22 10:42:06,322 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 113 [2024-11-22 10:42:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-22 10:42:06,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-22 10:42:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 10:42:06,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:06,325 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:42:06,331 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-22 10:42:06,529 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-22 10:42:06,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:06,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 934758522, now seen corresponding path program 1 times [2024-11-22 10:42:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414724090] [2024-11-22 10:42:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:06,532 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-22 10:42:06,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:06,535 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-22 10:42:06,537 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-22 10:42:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:06,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:42:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:42:14,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:42:14,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414724090] [2024-11-22 10:42:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414724090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:42:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:42:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744057789] [2024-11-22 10:42:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:42:14,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:42:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:42:14,049 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:14,702 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-11-22 10:42:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:42:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-22 10:42:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:14,706 INFO L225 Difference]: With dead ends: 94 [2024-11-22 10:42:14,706 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 10:42:14,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:42:14,711 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 31 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:14,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 319 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:42:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 10:42:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2024-11-22 10:42:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:42:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-11-22 10:42:14,729 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 113 [2024-11-22 10:42:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:14,730 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-11-22 10:42:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-11-22 10:42:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 10:42:14,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:14,734 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:42:14,739 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-22 10:42:14,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 168434842, now seen corresponding path program 1 times [2024-11-22 10:42:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975108797] [2024-11-22 10:42:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:14,936 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-22 10:42:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:14,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:14,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 10:42:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:15,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 10:42:15,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-22 10:42:21,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:42:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:42:44,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975108797] [2024-11-22 10:42:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975108797] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:42:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:42:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-22 10:42:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930886754] [2024-11-22 10:42:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:44,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:42:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:42:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-22 10:42:44,967 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:47,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-22 10:42:53,822 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 10:42:59,430 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 10:42:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:59,828 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-11-22 10:42:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:42:59,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-22 10:42:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:59,833 INFO L225 Difference]: With dead ends: 99 [2024-11-22 10:42:59,833 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 10:42:59,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-22 10:42:59,834 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 34 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:59,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 288 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-22 10:42:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 10:42:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2024-11-22 10:42:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:42:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-22 10:42:59,857 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 114 [2024-11-22 10:42:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-22 10:42:59,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:42:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-22 10:42:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 10:42:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:59,861 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:42:59,869 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 (5)] Forceful destruction successful, exit code 0 [2024-11-22 10:43:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-22 10:43:00,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 166587800, now seen corresponding path program 1 times [2024-11-22 10:43:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:43:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402418161] [2024-11-22 10:43:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:00,064 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-22 10:43:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:43:00,065 INFO L229 MonitoredProcess]: Starting monitored process 6 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-22 10:43:00,066 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 (6)] Waiting until timeout for monitored process [2024-11-22 10:43:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:00,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 10:43:00,142 INFO L278 TraceCheckSpWp]: Computing forward predicates...