./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.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_50-1loop_file-6.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 80b66d55201a59e6fb2b561c8aa94583a755adf48dc8184a2582d577054ebf7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:48:37,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:48:37,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:48:37,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:48:37,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:48:37,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:48:37,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:48:37,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:48:37,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:48:37,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:48:37,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:48:37,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:48:37,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:48:37,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:48:37,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:48:37,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:48:37,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:48:37,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:48:37,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:48:37,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:48:37,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:48:37,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:48:37,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:48:37,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:48:37,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:48:37,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:48:37,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:48:37,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:48:37,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:48:37,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:48:37,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:48:37,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:48:37,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:37,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:48:37,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:48:37,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:48:37,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:48:37,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:48:37,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:48:37,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:48:37,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:48:37,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:48:37,545 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 -> 80b66d55201a59e6fb2b561c8aa94583a755adf48dc8184a2582d577054ebf7a [2024-11-10 07:48:37,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:48:37,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:48:37,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:48:37,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:48:37,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:48:37,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:48:39,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:48:39,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:48:39,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:48:39,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b061c7d2/a1dae90af1f447ce988bd382f8fb9a9c/FLAGe8b07d078 [2024-11-10 07:48:39,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b061c7d2/a1dae90af1f447ce988bd382f8fb9a9c [2024-11-10 07:48:39,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:48:39,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:48:39,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:39,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:48:39,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:48:39,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4de219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39, skipping insertion in model container [2024-11-10 07:48:39,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:48:39,735 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_50-1loop_file-6.i[914,927] [2024-11-10 07:48:39,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:39,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:48:39,797 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_50-1loop_file-6.i[914,927] [2024-11-10 07:48:39,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:39,845 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:48:39,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39 WrapperNode [2024-11-10 07:48:39,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:39,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:39,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:48:39,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:48:39,854 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:48:39" (1/1) ... [2024-11-10 07:48:39,862 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:48:39" (1/1) ... [2024-11-10 07:48:39,884 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-10 07:48:39,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:39,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:48:39,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:48:39,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:48:39,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,931 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:48:39,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:48:39,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:48:39,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:48:39,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:48:39,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (1/1) ... [2024-11-10 07:48:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:39,987 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:48:39,990 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:48:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:48:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:48:40,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:48:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:48:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:48:40,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:48:40,128 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:48:40,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:48:40,483 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:48:40,483 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:48:40,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:48:40,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:48:40,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:40 BoogieIcfgContainer [2024-11-10 07:48:40,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:48:40,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:48:40,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:48:40,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:48:40,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:48:39" (1/3) ... [2024-11-10 07:48:40,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65938157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:40, skipping insertion in model container [2024-11-10 07:48:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:39" (2/3) ... [2024-11-10 07:48:40,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65938157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:40, skipping insertion in model container [2024-11-10 07:48:40,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:40" (3/3) ... [2024-11-10 07:48:40,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:48:40,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:48:40,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:48:40,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:48:40,606 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;@138a26dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:48:40,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:48:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:48:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 07:48:40,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:40,625 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:40,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -577168982, now seen corresponding path program 1 times [2024-11-10 07:48:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877909559] [2024-11-10 07:48:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:48:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:48:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:48:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:48:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:48:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:48:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:48:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:48:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:48:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:48:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:48:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:48:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:48:41,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877909559] [2024-11-10 07:48:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877909559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:48:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820070573] [2024-11-10 07:48:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:41,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:48:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:48:41,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:48:41,069 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:48:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:41,089 INFO L93 Difference]: Finished difference Result 108 states and 169 transitions. [2024-11-10 07:48:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:48:41,091 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-11-10 07:48:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:41,099 INFO L225 Difference]: With dead ends: 108 [2024-11-10 07:48:41,099 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 07:48:41,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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:48:41,109 INFO L432 NwaCegarLoop]: 76 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, 76 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:48:41,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:48:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 07:48:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 07:48:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:48:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-11-10 07:48:41,154 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 93 [2024-11-10 07:48:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:41,156 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-11-10 07:48:41,156 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:48:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-10 07:48:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 07:48:41,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:41,160 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:48:41,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash 257606635, now seen corresponding path program 1 times [2024-11-10 07:48:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052001165] [2024-11-10 07:48:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:48:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:48:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:48:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:48:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:48:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:48:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:48:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:48:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:48:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:48:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:48:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:48:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:48:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052001165] [2024-11-10 07:48:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052001165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:48:41,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256339083] [2024-11-10 07:48:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:41,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:48:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:48:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:48:41,830 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:48:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:42,015 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-10 07:48:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:48:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-10 07:48:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:42,020 INFO L225 Difference]: With dead ends: 149 [2024-11-10 07:48:42,020 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 07:48:42,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:48:42,022 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:48:42,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 200 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:48:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 07:48:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2024-11-10 07:48:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:48:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2024-11-10 07:48:42,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 93 [2024-11-10 07:48:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2024-11-10 07:48:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:48:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2024-11-10 07:48:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 07:48:42,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:42,063 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:48:42,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash -426742312, now seen corresponding path program 1 times [2024-11-10 07:48:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715025097] [2024-11-10 07:48:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:48:42,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287091256] [2024-11-10 07:48:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:48:42,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:42,136 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:48:42,137 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:48:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:48:42,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:48:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:48:42,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:48:42,379 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:48:42,380 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:48:42,401 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:48:42,582 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:48:42,586 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 07:48:42,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:48:42,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:48:42 BoogieIcfgContainer [2024-11-10 07:48:42,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:48:42,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:48:42,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:48:42,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:48:42,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:40" (3/4) ... [2024-11-10 07:48:42,690 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:48:42,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:48:42,694 INFO L158 Benchmark]: Toolchain (without parser) took 3138.26ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 141.6MB in the beginning and 105.2MB in the end (delta: 36.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,694 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:48:42,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.88ms. Allocated memory is still 169.9MB. Free memory was 141.6MB in the beginning and 126.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.28ms. Allocated memory is still 169.9MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,699 INFO L158 Benchmark]: Boogie Preprocessor took 57.91ms. Allocated memory is still 169.9MB. Free memory was 124.4MB in the beginning and 121.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,700 INFO L158 Benchmark]: IcfgBuilder took 556.18ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 130.0MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,700 INFO L158 Benchmark]: TraceAbstraction took 2182.79ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 129.2MB in the beginning and 105.2MB in the end (delta: 24.0MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-10 07:48:42,700 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 211.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:48:42,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.88ms. Allocated memory is still 169.9MB. Free memory was 141.6MB in the beginning and 126.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.28ms. Allocated memory is still 169.9MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.91ms. Allocated memory is still 169.9MB. Free memory was 124.4MB in the beginning and 121.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 556.18ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 130.0MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2182.79ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 129.2MB in the beginning and 105.2MB in the end (delta: 24.0MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 211.8MB. Free memory is still 105.2MB. 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 someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] isInitial = 1 [L122] FCALL initially() [L123] int k_loop; [L124] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L124] COND TRUE k_loop < 1 [L125] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_8 = var_1_8 [L111] last_1_var_1_12 = var_1_12 [L112] last_1_var_1_16 = var_1_16 [L113] last_1_var_1_17 = var_1_17 [L114] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L85] var_1_5 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_9 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_10 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_11 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] var_1_14 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L104] var_1_18 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L126] RET updateVariables() [L127] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L62] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=999, var_1_9=536870911] [L63] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L64] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L66] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) [L67] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L68] COND TRUE stepLocal_2 < var_1_11 [L69] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L73] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L74] COND FALSE !(\read(var_1_19)) [L81] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L127] RET step() [L128] CALL, EXPR property() [L117-L118] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 145 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 624/624 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:48:42,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.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 80b66d55201a59e6fb2b561c8aa94583a755adf48dc8184a2582d577054ebf7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:48:45,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:48:45,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:48:45,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:48:45,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:48:45,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:48:45,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:48:45,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:48:45,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:48:45,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:48:45,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:48:45,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:48:45,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:48:45,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:48:45,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:48:45,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:48:45,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:48:45,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:48:45,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:48:45,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:48:45,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:48:45,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:48:45,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:48:45,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:48:45,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:48:45,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:48:45,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:48:45,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:48:45,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:48:45,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:48:45,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:48:45,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:48:45,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:48:45,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:48:45,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:45,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:48:45,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:48:45,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:48:45,182 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:48:45,183 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:48:45,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:48:45,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:48:45,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:48:45,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:48:45,183 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 -> 80b66d55201a59e6fb2b561c8aa94583a755adf48dc8184a2582d577054ebf7a [2024-11-10 07:48:45,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:48:45,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:48:45,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:48:45,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:48:45,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:48:45,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:48:47,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:48:47,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:48:47,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:48:47,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10f71f98/451bae29f3ff4fa2a7c53224c9b709c0/FLAG1337f3358 [2024-11-10 07:48:47,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10f71f98/451bae29f3ff4fa2a7c53224c9b709c0 [2024-11-10 07:48:47,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:48:47,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:48:47,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:47,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:48:47,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:48:47,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5746eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47, skipping insertion in model container [2024-11-10 07:48:47,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:48:47,751 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_50-1loop_file-6.i[914,927] [2024-11-10 07:48:47,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:47,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:48:47,853 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_50-1loop_file-6.i[914,927] [2024-11-10 07:48:47,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:47,897 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:48:47,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47 WrapperNode [2024-11-10 07:48:47,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:47,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:47,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:48:47,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:48:47,905 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:48:47" (1/1) ... [2024-11-10 07:48:47,915 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:48:47" (1/1) ... [2024-11-10 07:48:47,943 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-10 07:48:47,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:47,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:48:47,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:48:47,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:48:47,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,980 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:48:47,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:47,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:48,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:48:48,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:48:48,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:48:48,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:48:48,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (1/1) ... [2024-11-10 07:48:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:48,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:48,034 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:48:48,036 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:48:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:48:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:48:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:48:48,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:48:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:48:48,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:48:48,142 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:48:48,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:49:13,063 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:49:13,063 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:49:13,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:49:13,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:49:13,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:49:13 BoogieIcfgContainer [2024-11-10 07:49:13,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:49:13,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:49:13,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:49:13,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:49:13,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:48:47" (1/3) ... [2024-11-10 07:49:13,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:49:13, skipping insertion in model container [2024-11-10 07:49:13,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:47" (2/3) ... [2024-11-10 07:49:13,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:49:13, skipping insertion in model container [2024-11-10 07:49:13,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:49:13" (3/3) ... [2024-11-10 07:49:13,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-6.i [2024-11-10 07:49:13,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:49:13,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:49:13,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:49:13,176 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;@555b4712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:49:13,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:49:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:49:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 07:49:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:13,196 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:13,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash -577168982, now seen corresponding path program 1 times [2024-11-10 07:49:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172439607] [2024-11-10 07:49:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:13,220 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:49:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:13,225 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:49:13,226 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:49:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:14,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:49:14,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 07:49:14,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:49:14,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:49:14,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172439607] [2024-11-10 07:49:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172439607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:14,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:49:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923614372] [2024-11-10 07:49:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:49:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:49:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:49:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:49:14,139 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:49:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:14,162 INFO L93 Difference]: Finished difference Result 108 states and 169 transitions. [2024-11-10 07:49:14,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:49:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-11-10 07:49:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:14,170 INFO L225 Difference]: With dead ends: 108 [2024-11-10 07:49:14,170 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 07:49:14,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:49:14,178 INFO L432 NwaCegarLoop]: 76 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, 76 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:49:14,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 07:49:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 07:49:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:49:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-11-10 07:49:14,213 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 93 [2024-11-10 07:49:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:14,214 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-11-10 07:49:14,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:49:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-10 07:49:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 07:49:14,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:14,218 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:14,244 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:49:14,419 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:49:14,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 257606635, now seen corresponding path program 1 times [2024-11-10 07:49:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267327319] [2024-11-10 07:49:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:14,422 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:49:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:14,424 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:49:14,426 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:49:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:15,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 07:49:15,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:49:17,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:49:17,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:49:17,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267327319] [2024-11-10 07:49:17,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267327319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:17,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:17,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987893711] [2024-11-10 07:49:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:49:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:49:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:49:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:49:17,715 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:49:22,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:26,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:30,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:34,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:34,806 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-10 07:49:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:49:34,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-10 07:49:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:34,924 INFO L225 Difference]: With dead ends: 149 [2024-11-10 07:49:34,924 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 07:49:34,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:34,926 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:34,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 201 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 17.0s Time] [2024-11-10 07:49:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 07:49:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2024-11-10 07:49:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:49:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2024-11-10 07:49:34,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 93 [2024-11-10 07:49:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:34,947 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2024-11-10 07:49:34,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:49:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2024-11-10 07:49:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 07:49:34,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:34,950 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,976 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:49:35,150 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:49:35,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash -426742312, now seen corresponding path program 1 times [2024-11-10 07:49:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694220883] [2024-11-10 07:49:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:35,153 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:49:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:35,155 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:49:35,156 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:49:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:36,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 07:49:36,838 INFO L278 TraceCheckSpWp]: Computing forward predicates...