./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.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 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:28:03,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:28:03,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:28:03,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:28:03,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:28:03,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:28:03,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:28:03,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:28:03,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:28:03,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:28:03,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:28:03,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:28:03,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:28:03,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:28:03,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:28:03,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:28:03,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:28:03,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:28:03,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:28:03,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:28:03,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:28:03,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:28:03,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:28:03,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:28:03,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:28:03,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:28:03,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:28:03,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:28:03,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:28:03,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:28:03,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:28:03,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:28:03,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:28:03,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:28:03,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:28:03,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:28:03,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:28:03,838 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 -> 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a [2024-10-24 05:28:04,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:28:04,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:28:04,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:28:04,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:28:04,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:28:04,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:05,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:28:05,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:28:05,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:05,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2997021de/8230d9812c454a459a73f1d5828af8b2/FLAGdd030f05e [2024-10-24 05:28:05,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2997021de/8230d9812c454a459a73f1d5828af8b2 [2024-10-24 05:28:05,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:28:05,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:28:05,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:28:05,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:28:05,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:28:05,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:05,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3017ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05, skipping insertion in model container [2024-10-24 05:28:05,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:05,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:28:05,798 WARN L248 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_codestructure_steplocals_file-13.i[917,930] [2024-10-24 05:28:05,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:28:05,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:28:05,894 WARN L248 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_codestructure_steplocals_file-13.i[917,930] [2024-10-24 05:28:05,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:28:05,936 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:28:05,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05 WrapperNode [2024-10-24 05:28:05,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:28:05,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:28:05,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:28:05,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:28:05,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:05,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,013 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-10-24 05:28:06,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:28:06,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:28:06,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:28:06,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:28:06,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,077 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-10-24 05:28:06,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:28:06,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:28:06,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:28:06,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:28:06,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (1/1) ... [2024-10-24 05:28:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:28:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:28:06,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-10-24 05:28:06,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:28:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:28:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:28:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:28:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:28:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:28:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:28:06,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:28:06,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:28:06,554 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 05:28:06,554 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:28:06,594 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:28:06,594 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:28:06,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:28:06 BoogieIcfgContainer [2024-10-24 05:28:06,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:28:06,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:28:06,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:28:06,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:28:06,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:28:05" (1/3) ... [2024-10-24 05:28:06,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e957f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:28:06, skipping insertion in model container [2024-10-24 05:28:06,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:05" (2/3) ... [2024-10-24 05:28:06,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e957f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:28:06, skipping insertion in model container [2024-10-24 05:28:06,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:28:06" (3/3) ... [2024-10-24 05:28:06,602 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:06,620 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:28:06,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:28:06,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:28:06,674 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;@5ce4c29c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:28:06,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:28:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:28:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 05:28:06,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:06,689 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:06,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1008969160, now seen corresponding path program 1 times [2024-10-24 05:28:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:28:06,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503265581] [2024-10-24 05:28:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:28:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:28:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:28:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:28:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:28:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:28:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:28:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:28:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:28:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:28:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:28:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:28:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:28:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:28:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:28:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:28:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:28:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:28:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:28:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:28:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:28:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:28:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:28:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:28:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:28:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:28:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:28:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:28:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:28:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:28:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:28:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503265581] [2024-10-24 05:28:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503265581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:28:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:28:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:28:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320942929] [2024-10-24 05:28:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:28:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:28:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:28:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:28:07,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:28:07,156 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:28:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:07,206 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2024-10-24 05:28:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:28:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-10-24 05:28:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:07,216 INFO L225 Difference]: With dead ends: 149 [2024-10-24 05:28:07,217 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 05:28:07,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-10-24 05:28:07,225 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:07,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:28:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 05:28:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-24 05:28:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:28:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-10-24 05:28:07,268 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 175 [2024-10-24 05:28:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-10-24 05:28:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:28:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-10-24 05:28:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 05:28:07,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:07,273 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:28:07,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:07,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1886349520, now seen corresponding path program 1 times [2024-10-24 05:28:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:28:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351187275] [2024-10-24 05:28:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:28:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:28:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:28:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:28:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:28:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:28:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:28:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:28:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:28:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:28:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:28:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:28:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:28:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:28:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:28:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:28:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:28:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:28:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:28:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:28:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:28:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:28:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:28:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:28:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:28:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:28:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:28:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:28:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:28:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:28:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:28:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351187275] [2024-10-24 05:28:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351187275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:28:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:28:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:28:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767642703] [2024-10-24 05:28:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:28:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:28:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:28:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:28:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:28:07,613 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:07,669 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2024-10-24 05:28:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:28:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-10-24 05:28:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:07,676 INFO L225 Difference]: With dead ends: 188 [2024-10-24 05:28:07,676 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 05:28:07,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:28:07,678 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:07,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 258 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:28:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 05:28:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-24 05:28:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 05:28:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2024-10-24 05:28:07,694 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 175 [2024-10-24 05:28:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2024-10-24 05:28:07,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2024-10-24 05:28:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 05:28:07,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:07,697 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:28:07,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:07,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 875232270, now seen corresponding path program 1 times [2024-10-24 05:28:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:28:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763024222] [2024-10-24 05:28:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:28:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:28:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:28:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:28:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:28:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:28:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:28:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:28:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:28:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:28:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:28:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:28:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:28:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:28:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:28:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:28:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:28:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:28:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:28:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:28:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:28:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:28:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:28:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:28:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:28:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:28:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:28:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:28:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 05:28:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:28:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:28:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763024222] [2024-10-24 05:28:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763024222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:28:08,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:28:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:28:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857840119] [2024-10-24 05:28:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:28:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:28:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:28:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:28:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:28:08,060 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:08,168 INFO L93 Difference]: Finished difference Result 282 states and 416 transitions. [2024-10-24 05:28:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:28:08,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-10-24 05:28:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:08,173 INFO L225 Difference]: With dead ends: 282 [2024-10-24 05:28:08,174 INFO L226 Difference]: Without dead ends: 171 [2024-10-24 05:28:08,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:28:08,178 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:08,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 292 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:28:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-24 05:28:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-10-24 05:28:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 117 states have internal predecessors, (148), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 05:28:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2024-10-24 05:28:08,209 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 175 [2024-10-24 05:28:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:08,211 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2024-10-24 05:28:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2024-10-24 05:28:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 05:28:08,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:08,216 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:28:08,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash 482205260, now seen corresponding path program 1 times [2024-10-24 05:28:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:28:08,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427731811] [2024-10-24 05:28:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:28:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:28:08,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104023080] [2024-10-24 05:28:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:08,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:28:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:28:08,347 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-10-24 05:28:08,349 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-10-24 05:28:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:28:08,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:28:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:28:08,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:28:08,688 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:28:08,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:28:08,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:28:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:28:08,895 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 05:28:08,994 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:28:08,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:28:08 BoogieIcfgContainer [2024-10-24 05:28:08,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:28:08,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:28:08,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:28:08,997 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:28:08,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:28:06" (3/4) ... [2024-10-24 05:28:08,999 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:28:09,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:28:09,001 INFO L158 Benchmark]: Toolchain (without parser) took 3377.90ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 63.4MB in the end (delta: 52.1MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,001 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:28:09,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.91ms. Allocated memory is still 184.5MB. Free memory was 115.4MB in the beginning and 99.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.59ms. Allocated memory is still 184.5MB. Free memory was 99.4MB in the beginning and 154.3MB in the end (delta: -54.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,002 INFO L158 Benchmark]: Boogie Preprocessor took 78.49ms. Allocated memory is still 184.5MB. Free memory was 154.3MB in the beginning and 148.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,002 INFO L158 Benchmark]: RCFGBuilder took 495.69ms. Allocated memory is still 184.5MB. Free memory was 148.3MB in the beginning and 120.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,002 INFO L158 Benchmark]: TraceAbstraction took 2400.73ms. Allocated memory is still 184.5MB. Free memory was 119.7MB in the beginning and 63.4MB in the end (delta: 56.2MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-24 05:28:09,002 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 184.5MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:28:09,004 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.21ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.91ms. Allocated memory is still 184.5MB. Free memory was 115.4MB in the beginning and 99.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.59ms. Allocated memory is still 184.5MB. Free memory was 99.4MB in the beginning and 154.3MB in the end (delta: -54.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.49ms. Allocated memory is still 184.5MB. Free memory was 154.3MB in the beginning and 148.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 495.69ms. Allocated memory is still 184.5MB. Free memory was 148.3MB in the beginning and 120.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2400.73ms. Allocated memory is still 184.5MB. Free memory was 119.7MB in the beginning and 63.4MB in the end (delta: 56.2MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 184.5MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of shiftRight at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int var_1_2 = 256; [L24] signed long int var_1_3 = 500; [L25] signed char var_1_4 = 16; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 1; [L28] unsigned short int var_1_7 = 50; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 64; [L33] signed char var_1_12 = -10; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = -25; [L36] double var_1_15 = 64.875; [L37] unsigned long int var_1_16 = 1000000; [L38] double var_1_17 = 1.625; [L39] double var_1_18 = 32.2; [L40] double var_1_19 = 8.6; [L41] double var_1_20 = 10.5; [L42] signed short int var_1_21 = -64; [L43] unsigned char var_1_22 = 25; [L44] unsigned char var_1_23 = 0; [L45] unsigned long int var_1_24 = 5; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L97] var_1_4 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L100] var_1_5 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L103] var_1_6 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L106] var_1_7 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L109] var_1_9 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L110] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L111] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L112] var_1_10 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=-2, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L120] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L124] var_1_16 = __VERIFIER_nondet_ulong() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_16 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 <= 4294967295) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L127] var_1_17 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L129] var_1_18 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L131] var_1_19 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L133] var_1_20 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L49] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L50] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L50] signed long int stepLocal_0 = var_1_3 >> var_1_4; [L51] COND FALSE !((~ var_1_2) != stepLocal_0) [L58] var_1_1 = 100 VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L60] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L63] unsigned char stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=1, var_1_10=-2, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L64] COND TRUE var_1_10 > stepLocal_2 [L65] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L67] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_3=100, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L68] COND FALSE !(var_1_4 > stepLocal_3) [L71] var_1_15 = var_1_17 VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L73] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L78] COND TRUE ((- var_1_11) < 8) || var_1_9 [L79] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L81] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L82] COND TRUE var_1_18 <= var_1_20 [L83] var_1_24 = ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))) VAL [isInitial=1, stepLocal_1=0, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L139-L140] return (((((((((~ var_1_2) != (var_1_3 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_8) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_8 % var_1_10) > var_1_16) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_23)) : 1)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_11=63, var_1_12=62, var_1_13=31, var_1_14=31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 376 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 875 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 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-10-24 05:28:09,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.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 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:28:11,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:28:11,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:28:11,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:28:11,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:28:11,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:28:11,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:28:11,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:28:11,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:28:11,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:28:11,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:28:11,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:28:11,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:28:11,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:28:11,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:28:11,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:28:11,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:28:11,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:28:11,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:28:11,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:28:11,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:28:11,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:28:11,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:28:11,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:28:11,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:28:11,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:28:11,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:28:11,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:28:11,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:28:11,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:28:11,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:28:11,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:28:11,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:28:11,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:28:11,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:28:11,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:28:11,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:28:11,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:28:11,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:28:11,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:28:11,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:28:11,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:28:11,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:28:11,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:28:11,152 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:28:11,152 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 -> 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a [2024-10-24 05:28:11,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:28:11,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:28:11,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:28:11,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:28:11,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:28:11,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:12,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:28:13,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:28:13,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:13,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e3cb00e/0608a8342e87488fb12721a1f754d469/FLAG01295f433 [2024-10-24 05:28:13,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e3cb00e/0608a8342e87488fb12721a1f754d469 [2024-10-24 05:28:13,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:28:13,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:28:13,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:28:13,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:28:13,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:28:13,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f1a7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13, skipping insertion in model container [2024-10-24 05:28:13,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:28:13,325 WARN L248 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_codestructure_steplocals_file-13.i[917,930] [2024-10-24 05:28:13,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:28:13,399 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:28:13,410 WARN L248 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_codestructure_steplocals_file-13.i[917,930] [2024-10-24 05:28:13,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:28:13,467 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:28:13,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13 WrapperNode [2024-10-24 05:28:13,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:28:13,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:28:13,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:28:13,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:28:13,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,532 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-24 05:28:13,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:28:13,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:28:13,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:28:13,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:28:13,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,566 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-10-24 05:28:13,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:28:13,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:28:13,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:28:13,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:28:13,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (1/1) ... [2024-10-24 05:28:13,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:28:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:28:13,625 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-10-24 05:28:13,628 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-10-24 05:28:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:28:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:28:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:28:13,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:28:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:28:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:28:13,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:28:13,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:28:17,076 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 05:28:17,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:28:17,122 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:28:17,123 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:28:17,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:28:17 BoogieIcfgContainer [2024-10-24 05:28:17,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:28:17,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:28:17,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:28:17,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:28:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:28:13" (1/3) ... [2024-10-24 05:28:17,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241686ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:28:17, skipping insertion in model container [2024-10-24 05:28:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:28:13" (2/3) ... [2024-10-24 05:28:17,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241686ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:28:17, skipping insertion in model container [2024-10-24 05:28:17,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:28:17" (3/3) ... [2024-10-24 05:28:17,132 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-13.i [2024-10-24 05:28:17,146 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:28:17,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:28:17,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:28:17,211 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;@1bc8e23f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:28:17,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:28:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:28:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:28:17,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:17,226 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:17,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1232254720, now seen corresponding path program 1 times [2024-10-24 05:28:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:28:17,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017922456] [2024-10-24 05:28:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:17,242 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-10-24 05:28:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:28:17,246 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-10-24 05:28:17,266 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-10-24 05:28:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:17,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:28:17,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:28:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-24 05:28:17,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:28:17,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:28:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017922456] [2024-10-24 05:28:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017922456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:28:17,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:28:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:28:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555188865] [2024-10-24 05:28:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:28:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:28:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:28:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:28:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:28:17,650 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:28:21,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:28:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:21,335 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-10-24 05:28:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:28:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-10-24 05:28:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:21,367 INFO L225 Difference]: With dead ends: 137 [2024-10-24 05:28:21,367 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 05:28:21,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-10-24 05:28:21,372 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:21,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 05:28:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 05:28:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 05:28:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:28:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-10-24 05:28:21,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 171 [2024-10-24 05:28:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:21,412 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-10-24 05:28:21,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:28:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-10-24 05:28:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:28:21,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:21,415 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:21,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:28:21,616 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-10-24 05:28:21,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1492922360, now seen corresponding path program 1 times [2024-10-24 05:28:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:28:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367212700] [2024-10-24 05:28:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:21,618 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-10-24 05:28:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:28:21,620 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-10-24 05:28:21,622 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-10-24 05:28:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:21,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 05:28:21,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:28:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 428 proven. 132 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-10-24 05:28:23,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:28:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 05:28:24,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:28:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367212700] [2024-10-24 05:28:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367212700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:28:24,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:28:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-10-24 05:28:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94272919] [2024-10-24 05:28:24,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:28:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 05:28:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:28:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 05:28:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 05:28:24,615 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-24 05:28:28,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:28:31,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:28:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:32,193 INFO L93 Difference]: Finished difference Result 199 states and 289 transitions. [2024-10-24 05:28:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 05:28:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 171 [2024-10-24 05:28:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:32,200 INFO L225 Difference]: With dead ends: 199 [2024-10-24 05:28:32,200 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 05:28:32,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2024-10-24 05:28:32,202 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 218 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:32,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 335 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-10-24 05:28:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 05:28:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2024-10-24 05:28:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:28:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2024-10-24 05:28:32,218 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 171 [2024-10-24 05:28:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:32,219 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2024-10-24 05:28:32,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-24 05:28:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2024-10-24 05:28:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:28:32,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:32,225 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:32,237 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-10-24 05:28:32,426 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-10-24 05:28:32,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1992698310, now seen corresponding path program 1 times [2024-10-24 05:28:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:28:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556181796] [2024-10-24 05:28:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:32,428 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-10-24 05:28:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:28:32,430 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-10-24 05:28:32,430 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-10-24 05:28:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:32,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:28:32,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:28:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:28:32,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:28:32,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:28:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556181796] [2024-10-24 05:28:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556181796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:28:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:28:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:28:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310224584] [2024-10-24 05:28:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:28:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:28:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:28:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:28:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:28:32,771 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:36,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:28:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:28:36,418 INFO L93 Difference]: Finished difference Result 268 states and 380 transitions. [2024-10-24 05:28:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:28:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-24 05:28:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:28:36,421 INFO L225 Difference]: With dead ends: 268 [2024-10-24 05:28:36,422 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 05:28:36,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:28:36,427 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 49 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 05:28:36,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 235 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 05:28:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 05:28:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-10-24 05:28:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 112 states have internal predecessors, (137), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 05:28:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2024-10-24 05:28:36,459 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 171 [2024-10-24 05:28:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:28:36,460 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2024-10-24 05:28:36,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:28:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2024-10-24 05:28:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:28:36,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:28:36,462 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:28:36,474 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 (4)] Ended with exit code 0 [2024-10-24 05:28:36,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:28:36,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:28:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:28:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2044103548, now seen corresponding path program 1 times [2024-10-24 05:28:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:28:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530791962] [2024-10-24 05:28:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:28:36,668 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-10-24 05:28:36,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:28:36,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:28:36,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 05:28:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:28:36,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 05:28:36,962 INFO L278 TraceCheckSpWp]: Computing forward predicates...