./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-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:10:36,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:10:36,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:10:36,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:10:36,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:10:36,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:10:36,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:10:36,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:10:36,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:10:36,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:10:36,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:10:36,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:10:36,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:10:36,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:10:36,840 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:10:36,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:10:36,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:10:36,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:10:36,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:10:36,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:10:36,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:10:36,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:10:36,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:10:36,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:10:36,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:10:36,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:10:36,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:10:36,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:10:36,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:10:36,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:10:36,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:10:36,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:10:36,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:36,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:10:36,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:10:36,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:10:36,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:10:36,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:10:36,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:10:36,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:10:36,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:10:36,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:10:36,850 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-13 00:10:37,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:10:37,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:10:37,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:10:37,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:10:37,185 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:10:37,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-13 00:10:38,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:10:38,958 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:10:38,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-13 00:10:38,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3b80ae7/1bafd8f996d5442781f2ddcf6aa5dc7a/FLAG0d1e0d04a [2024-10-13 00:10:38,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3b80ae7/1bafd8f996d5442781f2ddcf6aa5dc7a [2024-10-13 00:10:38,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:10:38,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:10:38,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:38,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:10:38,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:10:38,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:38" (1/1) ... [2024-10-13 00:10:38,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4509eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:38, skipping insertion in model container [2024-10-13 00:10:38,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:38" (1/1) ... [2024-10-13 00:10:39,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:10:39,191 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-21.i[917,930] [2024-10-13 00:10:39,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:39,274 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:10:39,291 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-21.i[917,930] [2024-10-13 00:10:39,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:39,389 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:10:39,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39 WrapperNode [2024-10-13 00:10:39,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:39,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:39,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:10:39,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:10:39,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,495 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-13 00:10:39,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:39,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:10:39,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:10:39,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:10:39,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,533 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-13 00:10:39,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:10:39,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:10:39,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:10:39,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:10:39,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (1/1) ... [2024-10-13 00:10:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:39,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:10:39,611 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-13 00:10:39,615 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-13 00:10:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:10:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:10:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:10:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:10:39,767 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:10:39,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:10:40,217 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-13 00:10:40,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:10:40,266 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:10:40,266 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:10:40,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:40 BoogieIcfgContainer [2024-10-13 00:10:40,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:10:40,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:10:40,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:10:40,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:10:40,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:10:38" (1/3) ... [2024-10-13 00:10:40,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb66b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:40, skipping insertion in model container [2024-10-13 00:10:40,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:39" (2/3) ... [2024-10-13 00:10:40,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb66b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:40, skipping insertion in model container [2024-10-13 00:10:40,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:40" (3/3) ... [2024-10-13 00:10:40,280 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-13 00:10:40,299 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:10:40,299 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:10:40,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:10:40,388 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;@3872ebee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:10:40,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:10:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:10:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 00:10:40,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:40,416 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:40,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:40,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 950371602, now seen corresponding path program 1 times [2024-10-13 00:10:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:10:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483733204] [2024-10-13 00:10:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:10:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:10:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:10:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:10:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:10:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:10:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:10:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:10:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:10:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:10:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:10:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:10:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:10:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:10:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:10:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:10:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:10:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:10:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:10:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:10:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:10:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:10:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:10:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:10:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:10:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:10:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:10:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:10:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:10:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:10:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:10:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:10:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:10:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 00:10:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:10:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483733204] [2024-10-13 00:10:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483733204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:10:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:10:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:10:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769004700] [2024-10-13 00:10:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:10:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:10:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:10:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:10:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:10:41,116 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:10:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:10:41,177 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-10-13 00:10:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:10:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 194 [2024-10-13 00:10:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:10:41,191 INFO L225 Difference]: With dead ends: 161 [2024-10-13 00:10:41,191 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 00:10:41,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-13 00:10:41,205 INFO L432 NwaCegarLoop]: 119 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, 119 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-13 00:10:41,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:10:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 00:10:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 00:10:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:10:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-13 00:10:41,279 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 194 [2024-10-13 00:10:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:10:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-13 00:10:41,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:10:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-13 00:10:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 00:10:41,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:41,288 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:41,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:10:41,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:41,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -668326134, now seen corresponding path program 1 times [2024-10-13 00:10:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:10:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534454869] [2024-10-13 00:10:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:10:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:10:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:10:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:10:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:10:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:10:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:10:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:10:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:10:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:10:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:10:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:10:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:10:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:10:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:10:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:10:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:10:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:10:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:10:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:10:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:10:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:10:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:10:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:10:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:10:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:10:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:10:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:10:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:10:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:10:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:10:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:10:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:10:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 00:10:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:10:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534454869] [2024-10-13 00:10:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534454869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:10:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:10:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:10:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605044796] [2024-10-13 00:10:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:10:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:10:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:10:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:10:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:10:54,002 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:10:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:10:54,718 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2024-10-13 00:10:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:10:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-13 00:10:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:10:54,724 INFO L225 Difference]: With dead ends: 205 [2024-10-13 00:10:54,724 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 00:10:54,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:10:54,727 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 54 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:10:54,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 419 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:10:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 00:10:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2024-10-13 00:10:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:10:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-13 00:10:54,744 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-13 00:10:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:10:54,749 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-13 00:10:54,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:10:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-13 00:10:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 00:10:54,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:54,753 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:10:54,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:54,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash -410160696, now seen corresponding path program 1 times [2024-10-13 00:10:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:10:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831894559] [2024-10-13 00:10:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:10:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:11:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:11:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:11:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:11:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:11:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:11:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:11:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:11:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:11:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:11:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:11:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:11:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:11:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:11:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:11:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:11:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:11:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:11:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:11:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:11:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:11:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:11:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:11:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:11:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:11:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:11:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:11:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:11:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:11:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:11:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:11:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:11:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 00:11:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:11:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831894559] [2024-10-13 00:11:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831894559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:11:00,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:11:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 00:11:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825172000] [2024-10-13 00:11:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:11:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:11:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:11:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:11:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:11:00,812 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:01,439 INFO L93 Difference]: Finished difference Result 207 states and 314 transitions. [2024-10-13 00:11:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:11:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-13 00:11:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:01,444 INFO L225 Difference]: With dead ends: 207 [2024-10-13 00:11:01,444 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 00:11:01,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:11:01,446 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:01,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 445 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:11:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 00:11:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2024-10-13 00:11:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:11:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-13 00:11:01,461 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-13 00:11:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:01,462 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-13 00:11:01,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-13 00:11:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 00:11:01,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:01,472 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:11:01,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:11:01,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:01,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:01,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1679443384, now seen corresponding path program 1 times [2024-10-13 00:11:01,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:01,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054086230] [2024-10-13 00:11:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:01,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:11:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:11:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:11:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:11:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:11:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:11:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:11:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:11:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:11:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:11:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:11:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:11:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:11:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:11:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:11:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:11:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:11:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:11:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:11:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:11:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:11:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:11:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:11:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:11:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:11:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:11:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:11:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:11:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:11:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:11:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:11:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:11:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 00:11:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:11:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054086230] [2024-10-13 00:11:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054086230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:11:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:11:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:11:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204474376] [2024-10-13 00:11:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:11:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:11:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:11:01,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:11:01,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:11:01,697 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:01,749 INFO L93 Difference]: Finished difference Result 196 states and 296 transitions. [2024-10-13 00:11:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:11:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-13 00:11:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:01,752 INFO L225 Difference]: With dead ends: 196 [2024-10-13 00:11:01,752 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 00:11:01,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:11:01,754 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 32 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:01,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 525 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:11:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 00:11:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-10-13 00:11:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:11:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-13 00:11:01,765 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 194 [2024-10-13 00:11:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:01,766 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-13 00:11:01,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-13 00:11:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 00:11:01,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:01,769 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:11:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:11:01,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:01,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1421277946, now seen corresponding path program 1 times [2024-10-13 00:11:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138144601] [2024-10-13 00:11:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:11:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:11:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:11:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:11:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:11:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:11:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:11:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:11:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:11:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:11:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:11:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:11:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:11:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:11:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:11:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:11:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:11:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:11:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:11:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:11:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:11:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:11:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:11:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:11:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:11:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:11:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:11:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:11:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:11:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:11:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:11:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:11:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 00:11:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:11:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138144601] [2024-10-13 00:11:06,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138144601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:11:06,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:11:06,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:11:06,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325624153] [2024-10-13 00:11:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:11:06,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:11:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:11:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:11:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:11:06,241 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:06,744 INFO L93 Difference]: Finished difference Result 196 states and 294 transitions. [2024-10-13 00:11:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:11:06,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-13 00:11:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:06,749 INFO L225 Difference]: With dead ends: 196 [2024-10-13 00:11:06,750 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 00:11:06,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:11:06,756 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 54 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:06,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 525 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:11:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 00:11:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2024-10-13 00:11:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:11:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-10-13 00:11:06,775 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 194 [2024-10-13 00:11:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:06,776 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-10-13 00:11:06,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 00:11:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-10-13 00:11:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 00:11:06,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:06,778 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:11:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:11:06,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:06,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1400761881, now seen corresponding path program 1 times [2024-10-13 00:11:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:06,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207141860] [2024-10-13 00:11:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:11:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613572127] [2024-10-13 00:11:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:11:06,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:11:06,880 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-13 00:11:06,881 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-13 00:11:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:11:07,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:11:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:11:07,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:11:07,250 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:11:07,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:11:07,266 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-13 00:11:07,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 00:11:07,458 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 00:11:07,584 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:11:07,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:11:07 BoogieIcfgContainer [2024-10-13 00:11:07,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:11:07,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:11:07,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:11:07,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:11:07,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:40" (3/4) ... [2024-10-13 00:11:07,593 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:11:07,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:11:07,595 INFO L158 Benchmark]: Toolchain (without parser) took 28605.95ms. Allocated memory was 180.4MB in the beginning and 914.4MB in the end (delta: 734.0MB). Free memory was 112.5MB in the beginning and 415.3MB in the end (delta: -302.8MB). Peak memory consumption was 433.3MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,595 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:11:07,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.09ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.3MB in the end (delta: -40.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.31ms. Allocated memory is still 180.4MB. Free memory was 152.3MB in the beginning and 147.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,596 INFO L158 Benchmark]: Boogie Preprocessor took 67.46ms. Allocated memory is still 180.4MB. Free memory was 147.6MB in the beginning and 140.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,596 INFO L158 Benchmark]: RCFGBuilder took 702.11ms. Allocated memory is still 180.4MB. Free memory was 140.2MB in the beginning and 112.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,597 INFO L158 Benchmark]: TraceAbstraction took 27317.61ms. Allocated memory was 180.4MB in the beginning and 914.4MB in the end (delta: 734.0MB). Free memory was 110.8MB in the beginning and 415.3MB in the end (delta: -304.5MB). Peak memory consumption was 431.5MB. Max. memory is 16.1GB. [2024-10-13 00:11:07,597 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 914.4MB. Free memory is still 415.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:11:07,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.09ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.3MB in the end (delta: -40.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.31ms. Allocated memory is still 180.4MB. Free memory was 152.3MB in the beginning and 147.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.46ms. Allocated memory is still 180.4MB. Free memory was 147.6MB in the beginning and 140.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 702.11ms. Allocated memory is still 180.4MB. Free memory was 140.2MB in the beginning and 112.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27317.61ms. Allocated memory was 180.4MB in the beginning and 914.4MB in the end (delta: 734.0MB). Free memory was 110.8MB in the beginning and 415.3MB in the end (delta: -304.5MB). Peak memory consumption was 431.5MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 914.4MB. Free memory is still 415.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed long int var_1_2 = -500; [L24] signed char var_1_3 = 1; [L25] signed char var_1_4 = 100; [L26] signed char var_1_5 = 5; [L27] signed char var_1_6 = 32; [L28] signed char var_1_7 = 32; [L29] unsigned short int var_1_8 = 8; [L30] unsigned short int var_1_9 = 25; [L31] unsigned short int var_1_10 = 21451; [L32] unsigned short int var_1_11 = 16; [L33] unsigned char var_1_12 = 8; [L34] unsigned short int var_1_13 = 16; [L35] unsigned char var_1_14 = 1; [L36] signed long int var_1_15 = 0; [L37] unsigned short int var_1_16 = 53444; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] double var_1_19 = 1.2; [L41] signed char var_1_20 = 1; [L42] double var_1_21 = 10.5; [L43] double var_1_22 = 0.0; [L44] double var_1_23 = 10.4; [L45] double var_1_24 = 50.5; [L46] unsigned short int var_1_25 = 2; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L92] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L94] var_1_5 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L95] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L98] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_long() [L116] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L121] var_1_18 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L124] var_1_20 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L127] var_1_21 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L128] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L129] var_1_22 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L130] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L131] var_1_23 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L132] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L133] var_1_24 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L134] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, stepLocal_0=-1000000, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L51] COND TRUE var_1_2 >= stepLocal_0 [L52] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L56] var_1_8 = (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11)) [L57] signed long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=32891, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L58] COND TRUE var_1_8 == stepLocal_1 [L59] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L61] signed long int stepLocal_2 = var_1_15; VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L62] COND FALSE !(\read(var_1_14)) [L69] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L71] COND TRUE ((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12) [L72] var_1_17 = var_1_18 VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L74] signed long int stepLocal_3 = var_1_5 - var_1_20; VAL [isInitial=1, stepLocal_2=-2147483648, stepLocal_3=0, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L75] COND TRUE var_1_1 >= stepLocal_3 [L76] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L78] COND TRUE (var_1_13 < var_1_12) || var_1_14 [L79] var_1_25 = (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139-L140] return (((((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((var_1_13 < var_1_12) || var_1_14) ? (var_1_25 == ((unsigned short int) (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 2033 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 581 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 12556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9920/9920 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-13 00:11:07,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:11:10,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:11:10,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:11:10,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:11:10,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:11:10,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:11:10,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:11:10,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:11:10,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:11:10,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:11:10,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:11:10,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:11:10,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:11:10,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:11:10,172 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:11:10,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:11:10,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:11:10,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:11:10,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:11:10,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:11:10,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:11:10,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:11:10,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:11:10,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:11:10,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:11:10,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:11:10,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:11:10,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:11:10,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:11:10,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:11:10,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:11:10,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:11:10,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:11:10,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:11:10,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:11:10,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:11:10,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:11:10,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:11:10,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:11:10,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:11:10,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:11:10,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:11:10,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:11:10,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:11:10,183 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:11:10,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-13 00:11:10,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:11:10,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:11:10,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:11:10,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:11:10,553 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:11:10,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-13 00:11:12,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:11:12,442 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:11:12,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-13 00:11:12,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17baa9a1/b9b883cbb9394c82acdbfa5e97d030c2/FLAGa3aef8a4d [2024-10-13 00:11:12,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17baa9a1/b9b883cbb9394c82acdbfa5e97d030c2 [2024-10-13 00:11:12,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:11:12,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:11:12,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:11:12,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:11:12,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:11:12,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9e4d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12, skipping insertion in model container [2024-10-13 00:11:12,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:11:12,727 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-21.i[917,930] [2024-10-13 00:11:12,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:11:12,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:11:12,834 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-21.i[917,930] [2024-10-13 00:11:12,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:11:12,901 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:11:12,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12 WrapperNode [2024-10-13 00:11:12,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:11:12,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:11:12,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:11:12,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:11:12,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,973 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-13 00:11:12,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:11:12,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:11:12,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:11:12,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:11:12,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:12,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,022 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-13 00:11:13,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:11:13,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:11:13,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:11:13,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:11:13,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (1/1) ... [2024-10-13 00:11:13,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:11:13,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:11:13,100 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-13 00:11:13,106 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-13 00:11:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:11:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:11:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:11:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:11:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:11:13,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:11:13,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:11:13,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:11:14,283 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:11:14,284 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:11:14,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:11:14,333 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:11:14,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:14 BoogieIcfgContainer [2024-10-13 00:11:14,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:11:14,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:11:14,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:11:14,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:11:14,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:11:12" (1/3) ... [2024-10-13 00:11:14,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adea8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:14, skipping insertion in model container [2024-10-13 00:11:14,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:12" (2/3) ... [2024-10-13 00:11:14,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adea8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:14, skipping insertion in model container [2024-10-13 00:11:14,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:14" (3/3) ... [2024-10-13 00:11:14,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-13 00:11:14,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:11:14,365 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:11:14,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:11:14,462 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;@6a52b946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:11:14,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:11:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:11:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 00:11:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:14,489 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:11:14,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash -694731706, now seen corresponding path program 1 times [2024-10-13 00:11:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:11:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957517847] [2024-10-13 00:11:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:14,515 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-13 00:11:14,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:11:14,519 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-13 00:11:14,520 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-13 00:11:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:14,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:11:14,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:11:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-10-13 00:11:15,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:11:15,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:11:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957517847] [2024-10-13 00:11:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957517847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:11:15,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:11:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:11:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076408085] [2024-10-13 00:11:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:11:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:11:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:11:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:11:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:11:15,045 INFO L87 Difference]: Start difference. First operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:11:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:16,016 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2024-10-13 00:11:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:11:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 192 [2024-10-13 00:11:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:16,041 INFO L225 Difference]: With dead ends: 143 [2024-10-13 00:11:16,041 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 00:11:16,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-13 00:11:16,048 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 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.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:16,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:11:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 00:11:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 00:11:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 00:11:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-13 00:11:16,103 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 192 [2024-10-13 00:11:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:16,104 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-13 00:11:16,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:11:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-13 00:11:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 00:11:16,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:16,114 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:11:16,124 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-13 00:11:16,316 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-13 00:11:16,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:16,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:16,319 INFO L85 PathProgramCache]: Analyzing trace with hash 273415230, now seen corresponding path program 1 times [2024-10-13 00:11:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:11:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654637524] [2024-10-13 00:11:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:16,324 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-13 00:11:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:11:16,326 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-13 00:11:16,328 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-13 00:11:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:18,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 00:11:18,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:11:54,550 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)