./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:54:59,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:54:59,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:54:59,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:54:59,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:54:59,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:54:59,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:54:59,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:54:59,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:54:59,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:54:59,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:54:59,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:54:59,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:54:59,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:54:59,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:54:59,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:54:59,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:54:59,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:54:59,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:54:59,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:54:59,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:54:59,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:54:59,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:54:59,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:54:59,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:54:59,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:54:59,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:54:59,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:54:59,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:54:59,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:54:59,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:54:59,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:54:59,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:54:59,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:54:59,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:54:59,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:54:59,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:54:59,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:54:59,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:54:59,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:54:59,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:54:59,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:54:59,478 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 -> fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 [2024-11-08 23:54:59,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:54:59,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:54:59,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:54:59,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:54:59,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:54:59,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:01,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:55:01,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:55:01,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:01,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59072abb6/d437ce60db744f60bd6267afe0390a72/FLAGab22b6e19 [2024-11-08 23:55:01,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59072abb6/d437ce60db744f60bd6267afe0390a72 [2024-11-08 23:55:01,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:55:01,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:55:01,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:55:01,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:55:01,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:55:01,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:01,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4088ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01, skipping insertion in model container [2024-11-08 23:55:01,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:01,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:55:01,838 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-while_file-67.i[915,928] [2024-11-08 23:55:01,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:55:01,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:55:01,911 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-while_file-67.i[915,928] [2024-11-08 23:55:01,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:55:01,945 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:55:01,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01 WrapperNode [2024-11-08 23:55:01,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:55:01,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:55:01,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:55:01,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:55:01,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:01,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:01,994 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-08 23:55:01,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:55:01,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:55:01,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:55:01,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:55:02,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:55:02,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:55:02,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:55:02,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:55:02,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:55:02,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (1/1) ... [2024-11-08 23:55:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:55:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:55:02,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:55:02,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:55:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:55:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:55:02,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:55:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:55:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:55:02,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:55:02,255 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:55:02,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:55:02,535 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:55:02,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:55:02,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:55:02,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:55:02,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:02 BoogieIcfgContainer [2024-11-08 23:55:02,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:55:02,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:55:02,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:55:02,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:55:02,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:55:01" (1/3) ... [2024-11-08 23:55:02,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b7329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:02, skipping insertion in model container [2024-11-08 23:55:02,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:01" (2/3) ... [2024-11-08 23:55:02,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b7329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:02, skipping insertion in model container [2024-11-08 23:55:02,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:02" (3/3) ... [2024-11-08 23:55:02,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:02,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:55:02,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:55:02,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:55:02,636 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;@788abc58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:55:02,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:55:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:55:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:02,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:02,651 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:02,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 442203561, now seen corresponding path program 1 times [2024-11-08 23:55:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:55:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497057651] [2024-11-08 23:55:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:55:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:55:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:55:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:55:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:55:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:55:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:55:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:55:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:55:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:55:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:55:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:55:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:55:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:55:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:55:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:55:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:55:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:55:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:55:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 23:55:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:55:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497057651] [2024-11-08 23:55:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497057651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:55:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:55:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:55:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611317308] [2024-11-08 23:55:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:55:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:55:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:55:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:55:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:55:03,064 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 23:55:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:55:03,084 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-11-08 23:55:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:55:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-11-08 23:55:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:55:03,092 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:55:03,093 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 23:55:03,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:55:03,102 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:55:03,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:55:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 23:55:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 23:55:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:55:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-11-08 23:55:03,161 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2024-11-08 23:55:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:55:03,161 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-11-08 23:55:03,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 23:55:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-11-08 23:55:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:03,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:03,167 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:03,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:55:03,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1663638361, now seen corresponding path program 1 times [2024-11-08 23:55:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:55:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155283983] [2024-11-08 23:55:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:55:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:55:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:55:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:55:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:55:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:55:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:55:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:55:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:55:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:55:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:55:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:55:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:55:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:55:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:55:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:55:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:55:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:55:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:55:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 23:55:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:55:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155283983] [2024-11-08 23:55:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155283983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:55:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:55:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:55:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931665413] [2024-11-08 23:55:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:55:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:55:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:55:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:55:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:55:03,684 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 23:55:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:55:03,983 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2024-11-08 23:55:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:55:03,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-11-08 23:55:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:55:03,986 INFO L225 Difference]: With dead ends: 196 [2024-11-08 23:55:03,987 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 23:55:03,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:55:03,988 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 96 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:55:03,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 280 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:55:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 23:55:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2024-11-08 23:55:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:55:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-08 23:55:04,026 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 117 [2024-11-08 23:55:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:55:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-08 23:55:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 23:55:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-08 23:55:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:04,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:04,035 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:04,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:55:04,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 111369001, now seen corresponding path program 1 times [2024-11-08 23:55:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:55:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655448144] [2024-11-08 23:55:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:55:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119154602] [2024-11-08 23:55:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:55:04,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:55:04,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:55:04,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:55:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:55:04,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:55:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:55:04,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:55:04,424 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:55:04,425 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:55:04,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:55:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:55:04,631 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:55:04,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:55:04,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:55:04 BoogieIcfgContainer [2024-11-08 23:55:04,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:55:04,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:55:04,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:55:04,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:55:04,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:02" (3/4) ... [2024-11-08 23:55:04,699 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:55:04,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:55:04,701 INFO L158 Benchmark]: Toolchain (without parser) took 3056.67ms. Allocated memory is still 205.5MB. Free memory was 176.0MB in the beginning and 145.5MB in the end (delta: 30.5MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-08 23:55:04,703 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:55:04,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.31ms. Allocated memory is still 205.5MB. Free memory was 175.8MB in the beginning and 165.2MB in the end (delta: 10.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-08 23:55:04,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 205.5MB. Free memory was 165.2MB in the beginning and 162.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:55:04,704 INFO L158 Benchmark]: Boogie Preprocessor took 85.03ms. Allocated memory is still 205.5MB. Free memory was 162.3MB in the beginning and 159.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:55:04,704 INFO L158 Benchmark]: RCFGBuilder took 472.74ms. Allocated memory is still 205.5MB. Free memory was 159.0MB in the beginning and 142.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:55:04,704 INFO L158 Benchmark]: TraceAbstraction took 2140.74ms. Allocated memory is still 205.5MB. Free memory was 141.3MB in the beginning and 145.5MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:55:04,704 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 205.5MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:55:04,705 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.16ms. Allocated memory is still 125.8MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.31ms. Allocated memory is still 205.5MB. Free memory was 175.8MB in the beginning and 165.2MB in the end (delta: 10.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 205.5MB. Free memory was 165.2MB in the beginning and 162.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.03ms. Allocated memory is still 205.5MB. Free memory was 162.3MB in the beginning and 159.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.74ms. Allocated memory is still 205.5MB. Free memory was 159.0MB in the beginning and 142.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2140.74ms. Allocated memory is still 205.5MB. Free memory was 141.3MB in the beginning and 145.5MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 205.5MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] signed short int var_1_7 = -128; [L27] unsigned short int var_1_8 = 16; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = 128; [L30] unsigned short int var_1_11 = 47512; [L31] unsigned char var_1_12 = 16; [L32] unsigned char var_1_13 = 1; [L33] float var_1_14 = 5.5; [L34] float var_1_15 = 24.5; [L35] signed short int last_1_var_1_1 = 2; [L36] unsigned short int last_1_var_1_6 = 128; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_1 = var_1_1 [L95] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_4 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L65] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L67] var_1_5 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L71] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L74] var_1_8 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L76] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=256] [L76] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=256] [L77] var_1_9 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536] [L79] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L80] var_1_11 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_11 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 <= 65535) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L91] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] signed long int stepLocal_1 = last_1_var_1_6; [L41] signed long int stepLocal_0 = last_1_var_1_6; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_0=128, stepLocal_1=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L42] COND FALSE !(stepLocal_0 >= (var_1_11 - var_1_8)) [L53] var_1_10 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L55] COND FALSE !(! (var_1_10 <= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-65536, var_1_9=0] [L58] COND TRUE var_1_4 > (var_1_10 / var_1_7) [L59] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=-65536, var_1_9=0] [L61] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=-65536, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! (var_1_10 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && ((var_1_4 > (var_1_10 / var_1_7)) ? (var_1_6 == ((unsigned short int) (var_1_8 + var_1_9))) : 1)) && ((last_1_var_1_6 >= (var_1_11 - var_1_8)) ? (((var_1_7 / var_1_12) <= last_1_var_1_6) ? (var_1_10 == ((signed long int) ((last_1_var_1_6 - var_1_8) + -32))) : (var_1_13 ? (var_1_10 == ((signed long int) ((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))))) : (var_1_10 == ((signed long int) var_1_5)))) : (var_1_10 == ((signed long int) last_1_var_1_1)))) && (var_1_14 == ((float) var_1_15)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=-65536, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=-65536, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=-65536, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 193 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:55:04,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:55:06,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:55:06,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:55:06,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:55:06,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:55:06,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:55:06,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:55:06,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:55:06,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:55:06,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:55:06,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:55:06,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:55:06,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:55:06,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:55:06,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:55:06,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:55:06,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:55:06,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:55:06,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:55:06,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:55:06,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:55:06,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:55:06,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:55:06,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:55:06,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:55:06,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:55:06,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:55:06,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:55:06,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:55:06,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:55:06,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:55:06,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:55:06,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:55:06,790 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:55:06,790 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:55:06,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:55:06,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:55:06,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:55:06,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:55:06,791 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 -> fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 [2024-11-08 23:55:07,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:55:07,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:55:07,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:55:07,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:55:07,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:55:07,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:08,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:55:08,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:55:08,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:08,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da754aad3/b37f08bb9d2d4eddb3b5e39d3340970d/FLAGb193a212c [2024-11-08 23:55:08,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da754aad3/b37f08bb9d2d4eddb3b5e39d3340970d [2024-11-08 23:55:08,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:55:08,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:55:08,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:55:08,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:55:08,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:55:08,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee5ed25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08, skipping insertion in model container [2024-11-08 23:55:08,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:55:08,826 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-while_file-67.i[915,928] [2024-11-08 23:55:08,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:55:08,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:55:08,873 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-while_file-67.i[915,928] [2024-11-08 23:55:08,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:55:08,902 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:55:08,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08 WrapperNode [2024-11-08 23:55:08,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:55:08,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:55:08,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:55:08,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:55:08,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,968 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-08 23:55:08,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:55:08,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:55:08,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:55:08,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:55:08,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:08,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,005 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:55:09,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:55:09,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:55:09,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:55:09,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:55:09,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (1/1) ... [2024-11-08 23:55:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:55:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:55:09,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:55:09,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:55:09,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:55:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:55:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:55:09,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:55:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:55:09,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:55:09,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:55:09,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:55:09,460 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:55:09,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:55:09,471 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:55:09,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:55:09,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:09 BoogieIcfgContainer [2024-11-08 23:55:09,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:55:09,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:55:09,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:55:09,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:55:09,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:55:08" (1/3) ... [2024-11-08 23:55:09,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe3de92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:09, skipping insertion in model container [2024-11-08 23:55:09,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:08" (2/3) ... [2024-11-08 23:55:09,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe3de92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:09, skipping insertion in model container [2024-11-08 23:55:09,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:09" (3/3) ... [2024-11-08 23:55:09,478 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-08 23:55:09,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:55:09,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:55:09,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:55:09,555 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52af0d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:55:09,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:55:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:55:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:09,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:09,572 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:09,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:09,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 442203561, now seen corresponding path program 1 times [2024-11-08 23:55:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:55:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024320150] [2024-11-08 23:55:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:09,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:55:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:55:09,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:55:09,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:55:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:09,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:55:09,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:55:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-08 23:55:09,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:55:09,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:55:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024320150] [2024-11-08 23:55:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024320150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:55:09,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:55:09,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:55:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524393446] [2024-11-08 23:55:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:55:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:55:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:55:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:55:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:55:09,862 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 23:55:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:55:09,889 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-11-08 23:55:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:55:09,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-11-08 23:55:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:55:09,897 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:55:09,898 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 23:55:09,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:55:09,903 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:55:09,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:55:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 23:55:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 23:55:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:55:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-11-08 23:55:09,945 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2024-11-08 23:55:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:55:09,945 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-11-08 23:55:09,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 23:55:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-11-08 23:55:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:09,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:09,949 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:09,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:55:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:55:10,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1663638361, now seen corresponding path program 1 times [2024-11-08 23:55:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:55:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349681597] [2024-11-08 23:55:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:10,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:55:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:55:10,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:55:10,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:55:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:10,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:55:10,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:55:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 23:55:10,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:55:10,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:55:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349681597] [2024-11-08 23:55:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349681597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:55:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:55:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:55:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115852126] [2024-11-08 23:55:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:55:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:55:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:55:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:55:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:55:10,679 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 23:55:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:55:11,091 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2024-11-08 23:55:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:55:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-11-08 23:55:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:55:11,099 INFO L225 Difference]: With dead ends: 196 [2024-11-08 23:55:11,099 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 23:55:11,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:55:11,101 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 93 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:55:11,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 280 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:55:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 23:55:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2024-11-08 23:55:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:55:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-08 23:55:11,145 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 117 [2024-11-08 23:55:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:55:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-08 23:55:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 23:55:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-08 23:55:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:55:11,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:55:11,149 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:55:11,158 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-08 23:55:11,350 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-08 23:55:11,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:55:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:55:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 111369001, now seen corresponding path program 1 times [2024-11-08 23:55:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:55:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885207062] [2024-11-08 23:55:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:55:11,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:55:11,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:55:11,354 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-08 23:55:11,356 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-08 23:55:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:11,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:55:11,514 INFO L278 TraceCheckSpWp]: Computing forward predicates...