./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-41.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 a34563caff72f9866734a8c4a4a8c9466c16382116556c064cc74473d1c9ecfd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:02:22,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:02:22,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:02:22,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:02:22,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:02:22,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:02:22,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:02:22,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:02:22,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:02:22,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:02:22,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:02:22,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:02:22,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:02:22,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:02:22,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:02:22,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:02:22,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:02:22,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:02:22,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:02:22,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:02:22,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:02:22,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:02:22,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:02:22,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:02:22,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:02:22,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:02:22,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:02:22,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:02:22,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:02:22,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:02:22,981 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 -> a34563caff72f9866734a8c4a4a8c9466c16382116556c064cc74473d1c9ecfd [2024-11-22 11:02:23,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:02:23,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:02:23,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:02:23,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:02:23,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:02:23,193 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-41.i [2024-11-22 11:02:24,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:02:24,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:02:24,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-41.i [2024-11-22 11:02:24,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/625485f89/c64b844fbffd4962a809aa8705434b58/FLAGb00b256d7 [2024-11-22 11:02:25,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/625485f89/c64b844fbffd4962a809aa8705434b58 [2024-11-22 11:02:25,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:02:25,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:02:25,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:02:25,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:02:25,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:02:25,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a112b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25, skipping insertion in model container [2024-11-22 11:02:25,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:02:25,194 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-41.i[915,928] [2024-11-22 11:02:25,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:02:25,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:02:25,249 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-41.i[915,928] [2024-11-22 11:02:25,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:02:25,283 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:02:25,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25 WrapperNode [2024-11-22 11:02:25,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:02:25,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:02:25,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:02:25,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:02:25,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,326 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-22 11:02:25,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:02:25,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:02:25,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:02:25,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:02:25,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,361 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:02:25,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:02:25,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:02:25,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:02:25,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:02:25,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (1/1) ... [2024-11-22 11:02:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:02:25,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:25,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:02:25,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:02:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:02:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:02:25,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:02:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:02:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:02:25,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:02:25,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:02:25,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:02:25,797 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 11:02:25,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:02:25,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:02:25,809 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:02:25,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:25 BoogieIcfgContainer [2024-11-22 11:02:25,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:02:25,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:02:25,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:02:25,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:02:25,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:25" (1/3) ... [2024-11-22 11:02:25,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ea323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:25, skipping insertion in model container [2024-11-22 11:02:25,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:25" (2/3) ... [2024-11-22 11:02:25,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ea323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:25, skipping insertion in model container [2024-11-22 11:02:25,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:25" (3/3) ... [2024-11-22 11:02:25,816 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-41.i [2024-11-22 11:02:25,827 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:02:25,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:02:25,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:02:25,874 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;@3e5d02b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:02:25,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:02:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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-22 11:02:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 11:02:25,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:25,885 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] [2024-11-22 11:02:25,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -657822016, now seen corresponding path program 1 times [2024-11-22 11:02:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:02:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690393886] [2024-11-22 11:02:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:02:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 11:02:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:02:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690393886] [2024-11-22 11:02:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690393886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:02:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620188485] [2024-11-22 11:02:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:26,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:26,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:26,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:02:26,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:02:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:26,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:02:26,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:02:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 11:02:26,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:02:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620188485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:02:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:02:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:02:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998376792] [2024-11-22 11:02:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:02:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:02:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:02:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:02:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:02:26,286 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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), 2 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-22 11:02:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:02:26,303 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2024-11-22 11:02:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:02:26,305 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), 2 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 91 [2024-11-22 11:02:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:02:26,311 INFO L225 Difference]: With dead ends: 103 [2024-11-22 11:02:26,312 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 11:02:26,314 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-22 11:02:26,317 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:02:26,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:02:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 11:02:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 11:02:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-22 11:02:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-22 11:02:26,351 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-22 11:02:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:02:26,351 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-22 11:02:26,351 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), 2 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-22 11:02:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-22 11:02:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 11:02:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:26,357 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] [2024-11-22 11:02:26,364 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-22 11:02:26,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:02:26,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:26,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1146824830, now seen corresponding path program 1 times [2024-11-22 11:02:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:02:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581381124] [2024-11-22 11:02:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:02:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 11:02:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927541632] [2024-11-22 11:02:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:26,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:26,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:02:26,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 11:02:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:26,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 11:02:26,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:02:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 11:02:27,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:02:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:02:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581381124] [2024-11-22 11:02:27,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 11:02:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927541632] [2024-11-22 11:02:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927541632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:02:27,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:02:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-22 11:02:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964932562] [2024-11-22 11:02:27,305 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 11:02:27,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 11:02:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:02:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 11:02:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 11:02:27,307 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:02:27,575 INFO L93 Difference]: Finished difference Result 138 states and 191 transitions. [2024-11-22 11:02:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 11:02:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-22 11:02:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:02:27,578 INFO L225 Difference]: With dead ends: 138 [2024-11-22 11:02:27,578 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 11:02:27,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-22 11:02:27,580 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:02:27,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 204 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:02:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 11:02:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2024-11-22 11:02:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 58 states have internal predecessors, (69), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 11:02:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-22 11:02:27,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 91 [2024-11-22 11:02:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:02:27,602 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-22 11:02:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-22 11:02:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 11:02:27,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:27,605 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] [2024-11-22 11:02:27,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 11:02:27,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 11:02:27,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:27,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1826883200, now seen corresponding path program 1 times [2024-11-22 11:02:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:02:27,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253989560] [2024-11-22 11:02:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:02:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 11:02:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357934113] [2024-11-22 11:02:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:27,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:27,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:27,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:02:27,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 11:02:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:28,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 11:02:28,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:02:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 11:02:28,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:02:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:02:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253989560] [2024-11-22 11:02:28,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 11:02:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357934113] [2024-11-22 11:02:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357934113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:02:28,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:02:28,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-22 11:02:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534847098] [2024-11-22 11:02:28,447 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 11:02:28,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 11:02:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:02:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 11:02:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-22 11:02:28,448 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:02:28,703 INFO L93 Difference]: Finished difference Result 178 states and 240 transitions. [2024-11-22 11:02:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 11:02:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-22 11:02:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:02:28,707 INFO L225 Difference]: With dead ends: 178 [2024-11-22 11:02:28,708 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 11:02:28,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-22 11:02:28,709 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 74 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:02:28,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 273 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:02:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 11:02:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2024-11-22 11:02:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 11:02:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-22 11:02:28,724 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 91 [2024-11-22 11:02:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:02:28,725 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-22 11:02:28,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-22 11:02:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 11:02:28,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:28,726 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] [2024-11-22 11:02:28,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 11:02:28,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:28,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1247180200, now seen corresponding path program 1 times [2024-11-22 11:02:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:02:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599449270] [2024-11-22 11:02:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:02:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 11:02:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062989600] [2024-11-22 11:02:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:28,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:02:29,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 11:02:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:02:29,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 11:02:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:02:29,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 11:02:29,310 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 11:02:29,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:02:29,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 11:02:29,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:02:29,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 11:02:29,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:02:29,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:02:29 BoogieIcfgContainer [2024-11-22 11:02:29,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:02:29,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:02:29,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:02:29,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:02:29,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:25" (3/4) ... [2024-11-22 11:02:29,579 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 11:02:29,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:02:29,580 INFO L158 Benchmark]: Toolchain (without parser) took 4544.86ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 105.1MB in the beginning and 99.3MB in the end (delta: 5.8MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,581 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:02:29,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.36ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 89.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.61ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 86.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,581 INFO L158 Benchmark]: Boogie Preprocessor took 51.59ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 80.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,581 INFO L158 Benchmark]: RCFGBuilder took 430.77ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 121.6MB in the end (delta: -40.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,582 INFO L158 Benchmark]: TraceAbstraction took 3764.64ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 120.4MB in the beginning and 99.3MB in the end (delta: 21.0MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-11-22 11:02:29,582 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 230.7MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:02:29,583 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.11ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.36ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 89.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.61ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 86.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.59ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 80.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 430.77ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 121.6MB in the end (delta: -40.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3764.64ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 120.4MB in the beginning and 99.3MB in the end (delta: 21.0MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 230.7MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] unsigned char last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] isInitial = 1 [L117] FCALL initially() [L118] int k_loop; [L119] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] COND TRUE k_loop < 1 [L120] CALL updateLastVariables() [L109] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] RET updateLastVariables() [L121] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L88] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L90] var_1_5 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L93] var_1_11 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L94] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L96] var_1_12 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L97] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L99] var_1_14 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L100] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L101] var_1_16 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L102] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] var_1_18 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET updateVariables() [L122] CALL step() [L42] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L43] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L50] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L55] COND FALSE !((- var_1_13) > 31.9f) [L58] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L60] COND TRUE \read(var_1_1) [L61] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L63] var_1_22 = 1 [L64] var_1_23 = var_1_22 [L65] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND TRUE var_1_15 > stepLocal_0 [L67] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L69] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L70] COND TRUE var_1_1 || stepLocal_2 [L71] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L75] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L76] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L79] COND FALSE !(! (var_1_17 <= var_1_17)) [L82] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L122] RET step() [L123] CALL, EXPR property() [L112-L113] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-180224, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 206 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=2, InterpolantAutomatonStates: 29, 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, 3 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 566 SizeOfPredicates, 6 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1218/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 11:02:29,605 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-41.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 a34563caff72f9866734a8c4a4a8c9466c16382116556c064cc74473d1c9ecfd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:02:31,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:02:31,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:02:31,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:02:31,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:02:31,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:02:31,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:02:31,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:02:31,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:02:31,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:02:31,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:02:31,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:02:31,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:02:31,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:02:31,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:02:31,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:02:31,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:02:31,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:02:31,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:02:31,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:02:31,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:02:31,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:02:31,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:02:31,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:02:31,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:02:31,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:02:31,573 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:02:31,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:02:31,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:02:31,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:02:31,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:02:31,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:02:31,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:02:31,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:02:31,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:02:31,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:02:31,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:02:31,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:02:31,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:02:31,578 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 -> a34563caff72f9866734a8c4a4a8c9466c16382116556c064cc74473d1c9ecfd [2024-11-22 11:02:31,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:02:31,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:02:31,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:02:31,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:02:31,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:02:31,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-41.i [2024-11-22 11:02:33,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:02:33,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:02:33,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-41.i [2024-11-22 11:02:33,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e37d2c0/0b36af1c8ce94d65a05ab38a01181664/FLAGde9e61945 [2024-11-22 11:02:33,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e37d2c0/0b36af1c8ce94d65a05ab38a01181664 [2024-11-22 11:02:33,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:02:33,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:02:33,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:02:33,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:02:33,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:02:33,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:33" (1/1) ... [2024-11-22 11:02:33,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6ff455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:33, skipping insertion in model container [2024-11-22 11:02:33,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:33" (1/1) ... [2024-11-22 11:02:33,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:02:33,878 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-41.i[915,928] [2024-11-22 11:02:33,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:02:33,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:02:33,960 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-41.i[915,928] [2024-11-22 11:02:33,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:02:34,015 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:02:34,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34 WrapperNode [2024-11-22 11:02:34,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:02:34,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:02:34,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:02:34,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:02:34,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,052 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-22 11:02:34,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:02:34,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:02:34,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:02:34,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:02:34,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:02:34,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:02:34,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:02:34,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:02:34,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:02:34,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (1/1) ... [2024-11-22 11:02:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:02:34,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:02:34,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:02:34,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:02:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:02:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:02:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:02:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:02:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:02:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:02:34,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:02:34,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:02:37,992 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 11:02:37,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:02:38,002 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:02:38,002 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:02:38,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:38 BoogieIcfgContainer [2024-11-22 11:02:38,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:02:38,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:02:38,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:02:38,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:02:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:33" (1/3) ... [2024-11-22 11:02:38,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97a9d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:38, skipping insertion in model container [2024-11-22 11:02:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:34" (2/3) ... [2024-11-22 11:02:38,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97a9d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:38, skipping insertion in model container [2024-11-22 11:02:38,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:38" (3/3) ... [2024-11-22 11:02:38,009 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-41.i [2024-11-22 11:02:38,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:02:38,021 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:02:38,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:02:38,075 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;@274c928d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:02:38,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:02:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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-22 11:02:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 11:02:38,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:38,086 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] [2024-11-22 11:02:38,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash -657822016, now seen corresponding path program 1 times [2024-11-22 11:02:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:02:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005825143] [2024-11-22 11:02:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:38,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:02:38,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:02:38,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:02:38,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 11:02:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:38,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:02:38,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:02:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-22 11:02:38,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:02:38,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:02:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005825143] [2024-11-22 11:02:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005825143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:02:38,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:02:38,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 11:02:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416821167] [2024-11-22 11:02:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:02:38,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:02:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:02:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:02:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:02:38,420 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-22 11:02:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:02:38,441 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2024-11-22 11:02:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:02:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 91 [2024-11-22 11:02:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:02:38,449 INFO L225 Difference]: With dead ends: 103 [2024-11-22 11:02:38,449 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 11:02:38,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-22 11:02:38,455 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:02:38,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:02:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 11:02:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 11:02:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-22 11:02:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-22 11:02:38,492 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-22 11:02:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:02:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-22 11:02:38,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-22 11:02:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-22 11:02:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 11:02:38,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:38,495 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] [2024-11-22 11:02:38,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 11:02:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:02:38,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1146824830, now seen corresponding path program 1 times [2024-11-22 11:02:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:02:38,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045813943] [2024-11-22 11:02:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:02:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:02:38,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:02:38,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 11:02:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:38,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 11:02:38,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:02:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 11:02:39,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:02:39,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:02:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045813943] [2024-11-22 11:02:39,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045813943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:02:39,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:02:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 11:02:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624730181] [2024-11-22 11:02:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:02:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 11:02:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:02:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 11:02:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:02:39,282 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:41,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 11:02:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:02:41,208 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2024-11-22 11:02:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 11:02:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-22 11:02:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:02:41,230 INFO L225 Difference]: With dead ends: 105 [2024-11-22 11:02:41,230 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 11:02:41,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 11:02:41,231 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 11:02:41,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 199 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 11:02:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 11:02:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-22 11:02:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 11:02:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-22 11:02:41,240 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 91 [2024-11-22 11:02:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:02:41,241 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-22 11:02:41,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 11:02:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-22 11:02:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 11:02:41,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:02:41,243 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] [2024-11-22 11:02:41,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 11:02:41,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:02:41,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:02:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:02:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1247180200, now seen corresponding path program 1 times [2024-11-22 11:02:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:02:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883498833] [2024-11-22 11:02:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:02:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:02:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:02:41,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:02:41,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 11:02:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:02:41,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 11:02:41,774 INFO L278 TraceCheckSpWp]: Computing forward predicates...