./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:38:25,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:38:26,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:38:26,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:38:26,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:38:26,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:38:26,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:38:26,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:38:26,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:38:26,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:38:26,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:38:26,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:38:26,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:38:26,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:38:26,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:38:26,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:38:26,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:38:26,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:38:26,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:38:26,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:38:26,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:38:26,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:38:26,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:38:26,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:38:26,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:38:26,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:38:26,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:38:26,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:26,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:38:26,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:38:26,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:38:26,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:38:26,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:38:26,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:38:26,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:38:26,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:38:26,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:38:26,049 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-10 07:38:26,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:38:26,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:38:26,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:38:26,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:38:26,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:38:26,341 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-10 07:38:27,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:38:27,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:38:27,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-10 07:38:28,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f591068/2d32ad76efdc4dd9bb1e0b86867499c0/FLAG33bc6f87e [2024-11-10 07:38:28,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f591068/2d32ad76efdc4dd9bb1e0b86867499c0 [2024-11-10 07:38:28,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:38:28,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:38:28,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:28,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:38:28,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:38:28,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37047d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28, skipping insertion in model container [2024-11-10 07:38:28,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:38:28,185 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-10 07:38:28,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:28,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:38:28,259 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-10 07:38:28,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:28,290 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:38:28,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28 WrapperNode [2024-11-10 07:38:28,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:28,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:28,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:38:28,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:38:28,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,342 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-10 07:38:28,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:28,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:38:28,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:38:28,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:38:28,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,374 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:38:28,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:38:28,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:38:28,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:38:28,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:38:28,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:28,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:38:28,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:38:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:38:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:38:28,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:38:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:38:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:38:28,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:38:28,618 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:38:28,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:38:28,861 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 07:38:28,861 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:38:28,877 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:38:28,877 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:38:28,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:28 BoogieIcfgContainer [2024-11-10 07:38:28,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:38:28,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:38:28,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:38:28,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:38:28,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:38:28" (1/3) ... [2024-11-10 07:38:28,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:28, skipping insertion in model container [2024-11-10 07:38:28,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (2/3) ... [2024-11-10 07:38:28,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:28, skipping insertion in model container [2024-11-10 07:38:28,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:28" (3/3) ... [2024-11-10 07:38:28,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-10 07:38:28,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:38:28,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:38:28,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:38:28,964 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;@163909a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:38:28,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:38:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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-10 07:38:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:28,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:28,982 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, 1, 1] [2024-11-10 07:38:28,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:28,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2040240455, now seen corresponding path program 1 times [2024-11-10 07:38:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:38:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132302811] [2024-11-10 07:38:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:38:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:38:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:38:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:38:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:38:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:38:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:38:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:38:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:38:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:38:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:38:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:38:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:38:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:38:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:38:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:38:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:38:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:38:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:38:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:38:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,272 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-10 07:38:29,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:38:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132302811] [2024-11-10 07:38:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132302811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:38:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062169409] [2024-11-10 07:38:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:29,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:38:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:38:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:38:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:38:29,299 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-10 07:38:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:29,318 INFO L93 Difference]: Finished difference Result 104 states and 176 transitions. [2024-11-10 07:38:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:38:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (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 119 [2024-11-10 07:38:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:29,324 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:38:29,325 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 07:38:29,327 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-10 07:38:29,329 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:38:29,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:38:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 07:38:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 07:38:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-10 07:38:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-10 07:38:29,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 119 [2024-11-10 07:38:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:29,371 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-10 07:38:29,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (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-10 07:38:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-10 07:38:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:29,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:29,375 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, 1, 1] [2024-11-10 07:38:29,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:38:29,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:29,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1611945384, now seen corresponding path program 1 times [2024-11-10 07:38:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:38:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915410352] [2024-11-10 07:38:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:38:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:38:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:38:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:38:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:38:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:38:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:38:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:38:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:38:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:38:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:38:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:38:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:38:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:38:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:38:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:38:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:38:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:38:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:38:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:38:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:29,839 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-10 07:38:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:38:29,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915410352] [2024-11-10 07:38:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915410352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:38:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782780164] [2024-11-10 07:38:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:29,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:38:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:38:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:38:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:38:29,844 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-10 07:38:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:30,099 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2024-11-10 07:38:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:38:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 119 [2024-11-10 07:38:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:30,102 INFO L225 Difference]: With dead ends: 206 [2024-11-10 07:38:30,104 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 07:38:30,105 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-10 07:38:30,106 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 93 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:38:30,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 290 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:38:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 07:38:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2024-11-10 07:38:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 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-10 07:38:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-10 07:38:30,145 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 119 [2024-11-10 07:38:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:30,146 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-10 07:38:30,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-10 07:38:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-10 07:38:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:30,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:30,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, 1, 1] [2024-11-10 07:38:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:38:30,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash -940211577, now seen corresponding path program 1 times [2024-11-10 07:38:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:38:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895786333] [2024-11-10 07:38:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:38:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:38:30,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943147457] [2024-11-10 07:38:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:38:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:30,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:38:30,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:38:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:38:30,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:38:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:38:30,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:38:30,426 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:38:30,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:38:30,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:38:30,629 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-10 07:38:30,633 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 07:38:30,718 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:38:30,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:38:30 BoogieIcfgContainer [2024-11-10 07:38:30,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:38:30,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:38:30,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:38:30,723 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:38:30,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:28" (3/4) ... [2024-11-10 07:38:30,725 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:38:30,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:38:30,728 INFO L158 Benchmark]: Toolchain (without parser) took 2703.39ms. Allocated memory is still 197.1MB. Free memory was 145.6MB in the beginning and 90.6MB in the end (delta: 55.0MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,729 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:38:30,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.57ms. Allocated memory is still 197.1MB. Free memory was 145.6MB in the beginning and 130.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 197.1MB. Free memory was 130.9MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,730 INFO L158 Benchmark]: Boogie Preprocessor took 46.01ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 125.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,730 INFO L158 Benchmark]: IcfgBuilder took 484.28ms. Allocated memory is still 197.1MB. Free memory was 125.3MB in the beginning and 152.3MB in the end (delta: -26.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,730 INFO L158 Benchmark]: TraceAbstraction took 1842.56ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 90.6MB in the end (delta: 60.6MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-11-10 07:38:30,730 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 197.1MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:38:30,732 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.18ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.57ms. Allocated memory is still 197.1MB. Free memory was 145.6MB in the beginning and 130.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 197.1MB. Free memory was 130.9MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.01ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 125.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 484.28ms. Allocated memory is still 197.1MB. Free memory was 125.3MB in the beginning and 152.3MB in the end (delta: -26.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1842.56ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 90.6MB in the end (delta: 60.6MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 197.1MB. Free memory is still 90.6MB. 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0] [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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0] [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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L58] COND FALSE !(var_1_4 > (var_1_10 / var_1_7)) 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=4, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, 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=4, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=0, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 198 mSDtfsCounter, 72 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=97occurred 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, 61 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 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-10 07:38:30,765 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:38:33,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:38:33,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:38:33,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:38:33,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:38:33,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:38:33,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:38:33,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:38:33,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:38:33,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:38:33,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:38:33,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:38:33,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:38:33,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:38:33,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:38:33,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:38:33,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:38:33,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:38:33,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:38:33,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:38:33,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:38:33,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:38:33,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:38:33,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:38:33,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:38:33,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:38:33,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:38:33,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:38:33,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:33,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:38:33,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:38:33,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:38:33,204 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:38:33,204 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:38:33,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:38:33,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:38:33,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:38:33,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:38:33,206 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-10 07:38:33,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:38:33,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:38:33,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:38:33,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:38:33,538 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:38:33,540 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-10 07:38:35,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:38:35,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:38:35,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-10 07:38:35,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f2daef4/9ec36f817e7c4c069946016b7cb6a1aa/FLAG33815aee9 [2024-11-10 07:38:35,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f2daef4/9ec36f817e7c4c069946016b7cb6a1aa [2024-11-10 07:38:35,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:38:35,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:38:35,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:35,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:38:35,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:38:35,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643f0d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35, skipping insertion in model container [2024-11-10 07:38:35,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:38:35,486 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-10 07:38:35,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:35,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:38:35,558 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-10 07:38:35,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:35,599 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:38:35,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35 WrapperNode [2024-11-10 07:38:35,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:35,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:35,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:38:35,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:38:35,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,645 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-10 07:38:35,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:35,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:38:35,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:38:35,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:38:35,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,702 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:38:35,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:38:35,721 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:38:35,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:38:35,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:38:35,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (1/1) ... [2024-11-10 07:38:35,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:35,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:38:35,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:38:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:38:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:38:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:38:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:38:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:38:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:38:35,869 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:38:35,872 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:38:36,207 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 07:38:36,208 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:38:36,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:38:36,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:38:36,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:36 BoogieIcfgContainer [2024-11-10 07:38:36,221 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:38:36,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:38:36,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:38:36,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:38:36,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:38:35" (1/3) ... [2024-11-10 07:38:36,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c3f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:36, skipping insertion in model container [2024-11-10 07:38:36,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:35" (2/3) ... [2024-11-10 07:38:36,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616c3f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:36, skipping insertion in model container [2024-11-10 07:38:36,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:36" (3/3) ... [2024-11-10 07:38:36,231 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2024-11-10 07:38:36,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:38:36,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:38:36,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:38:36,301 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;@57958f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:38:36,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:38:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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-10 07:38:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:36,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:36,315 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, 1, 1] [2024-11-10 07:38:36,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:36,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2040240455, now seen corresponding path program 1 times [2024-11-10 07:38:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:38:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291102986] [2024-11-10 07:38:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:38:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:38:36,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:38:36,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:38:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:36,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:38:36,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:38:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-10 07:38:36,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:38:36,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:38:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291102986] [2024-11-10 07:38:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291102986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:38:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171483825] [2024-11-10 07:38:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:36,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:38:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:38:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:38:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:38:36,601 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-10 07:38:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:36,629 INFO L93 Difference]: Finished difference Result 104 states and 176 transitions. [2024-11-10 07:38:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:38:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 119 [2024-11-10 07:38:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:36,638 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:38:36,638 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 07:38:36,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:38:36,644 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:38:36,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:38:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 07:38:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 07:38:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-10 07:38:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-10 07:38:36,674 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 119 [2024-11-10 07:38:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-10 07:38:36,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-10 07:38:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-10 07:38:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:36,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:36,678 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, 1, 1] [2024-11-10 07:38:36,684 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-10 07:38:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:38:36,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1611945384, now seen corresponding path program 1 times [2024-11-10 07:38:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:38:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229804125] [2024-11-10 07:38:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:38:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:38:36,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:38:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:38:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:37,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:38:37,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:38:37,346 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-10 07:38:37,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:38:37,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:38:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229804125] [2024-11-10 07:38:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229804125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:38:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183098008] [2024-11-10 07:38:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:38:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:38:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:38:37,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:38:37,351 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10 07:38:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:37,791 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2024-11-10 07:38:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:38:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 119 [2024-11-10 07:38:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:37,802 INFO L225 Difference]: With dead ends: 206 [2024-11-10 07:38:37,802 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 07:38:37,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-10 07:38:37,806 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 90 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:38:37,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 290 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:38:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 07:38:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2024-11-10 07:38:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 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-10 07:38:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-10 07:38:37,847 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 119 [2024-11-10 07:38:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:37,848 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-10 07:38:37,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10 07:38:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-10 07:38:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:38:37,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:37,851 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, 1, 1] [2024-11-10 07:38:37,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:38:38,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:38:38,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:38,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -940211577, now seen corresponding path program 1 times [2024-11-10 07:38:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:38:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133426869] [2024-11-10 07:38:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:38:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:38:38,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:38:38,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 07:38:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:38,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 07:38:38,175 INFO L278 TraceCheckSpWp]: Computing forward predicates...