./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_fillercode_fillercodesize_ps-cn-10_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:03:37,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:03:37,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:03:37,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:03:37,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:03:37,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:03:37,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:03:37,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:03:37,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:03:37,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:03:37,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:03:37,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:03:37,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:03:37,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:03:37,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:03:37,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:03:37,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:03:37,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:03:37,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:03:37,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:03:37,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:03:37,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:03:37,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:03:37,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:03:37,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:03:37,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:03:37,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:03:37,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:03:37,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:03:37,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:03:37,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:03:37,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:03:37,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:03:37,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:03:37,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:03:37,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:03:37,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:03:37,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:03:37,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:03:37,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:03:37,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:03:37,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:03:37,659 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-clean/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-clean/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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2024-10-11 08:03:37,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:03:37,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:03:37,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:03:37,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:03:37,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:03:37,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:39,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:03:39,229 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:03:39,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:39,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ed335950/ad2e01a0e4ee4d67b84ce1e7c0062057/FLAG9c1677dee [2024-10-11 08:03:39,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ed335950/ad2e01a0e4ee4d67b84ce1e7c0062057 [2024-10-11 08:03:39,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:03:39,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:03:39,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:03:39,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:03:39,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:03:39,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a798c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39, skipping insertion in model container [2024-10-11 08:03:39,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:03:39,787 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2024-10-11 08:03:39,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:03:39,860 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:03:39,868 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2024-10-11 08:03:39,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:03:39,902 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:03:39,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39 WrapperNode [2024-10-11 08:03:39,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:03:39,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:03:39,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:03:39,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:03:39,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,962 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-10-11 08:03:39,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:03:39,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:03:39,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:03:39,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:03:39,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,986 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-11 08:03:39,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:39,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:03:39,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:03:39,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:03:39,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:03:40,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (1/1) ... [2024-10-11 08:03:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:03:40,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:03:40,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:03:40,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:03:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:03:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:03:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:03:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:03:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:03:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:03:40,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:03:40,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:03:40,391 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 08:03:40,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:03:40,429 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:03:40,429 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:03:40,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:03:40 BoogieIcfgContainer [2024-10-11 08:03:40,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:03:40,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:03:40,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:03:40,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:03:40,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:03:39" (1/3) ... [2024-10-11 08:03:40,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e037cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:03:40, skipping insertion in model container [2024-10-11 08:03:40,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:39" (2/3) ... [2024-10-11 08:03:40,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e037cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:03:40, skipping insertion in model container [2024-10-11 08:03:40,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:03:40" (3/3) ... [2024-10-11 08:03:40,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:40,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:03:40,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:03:40,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:03:40,503 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;@7cb9eb0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:03:40,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:03:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:03:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:40,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:40,521 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:40,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:40,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -64128461, now seen corresponding path program 1 times [2024-10-11 08:03:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:03:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917054485] [2024-10-11 08:03:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:03:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:03:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:03:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:03:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:03:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:03:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:03:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:03:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:03:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:03:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:03:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:03:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:03:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:03:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:03:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:03:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:03:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:03:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:03:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:03:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:03:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:03:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:03:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 08:03:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:03:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 08:03:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:03:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:03:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:03:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:03:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:03:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:03:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:03:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:03:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:03:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:03:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:03:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:03:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:03:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 08:03:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-11 08:03:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:03:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917054485] [2024-10-11 08:03:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917054485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:03:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:03:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136410603] [2024-10-11 08:03:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:40,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:03:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:03:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:03:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:03:40,992 INFO L87 Difference]: Start difference. First operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-11 08:03:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:41,067 INFO L93 Difference]: Finished difference Result 169 states and 315 transitions. [2024-10-11 08:03:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:03:41,070 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 229 [2024-10-11 08:03:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:41,079 INFO L225 Difference]: With dead ends: 169 [2024-10-11 08:03:41,080 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 08:03:41,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-11 08:03:41,087 INFO L432 NwaCegarLoop]: 131 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, 131 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-11 08:03:41,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:03:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 08:03:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 08:03:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:03:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2024-10-11 08:03:41,143 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 229 [2024-10-11 08:03:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:41,143 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2024-10-11 08:03:41,144 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-11 08:03:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-10-11 08:03:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:41,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:41,151 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:41,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:03:41,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:41,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -542001939, now seen corresponding path program 1 times [2024-10-11 08:03:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:03:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491871000] [2024-10-11 08:03:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:03:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:03:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:03:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:03:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:03:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:03:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:03:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:03:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:03:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:03:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:03:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:03:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:03:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:03:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:03:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:03:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:03:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:03:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:03:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:03:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:03:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:03:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:03:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 08:03:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:03:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 08:03:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:03:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:03:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:03:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:03:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:03:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:03:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:03:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:03:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:03:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:03:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:03:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:03:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:03:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 08:03:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-11 08:03:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:03:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491871000] [2024-10-11 08:03:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491871000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:41,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:03:41,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:03:41,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97470008] [2024-10-11 08:03:41,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:41,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:03:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:03:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:03:41,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:03:41,664 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:41,717 INFO L93 Difference]: Finished difference Result 250 states and 400 transitions. [2024-10-11 08:03:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:03:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 229 [2024-10-11 08:03:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:41,721 INFO L225 Difference]: With dead ends: 250 [2024-10-11 08:03:41,721 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 08:03:41,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:03:41,724 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 64 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:41,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:03:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 08:03:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-10-11 08:03:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:03:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 265 transitions. [2024-10-11 08:03:41,763 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 265 transitions. Word has length 229 [2024-10-11 08:03:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 265 transitions. [2024-10-11 08:03:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 265 transitions. [2024-10-11 08:03:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:41,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:41,770 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:03:41,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -540154897, now seen corresponding path program 1 times [2024-10-11 08:03:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:03:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190842307] [2024-10-11 08:03:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:03:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:03:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:03:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:03:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:03:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:03:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:03:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:03:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:03:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:03:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:03:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:03:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:03:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:03:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:03:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:03:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:03:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:03:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:03:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:03:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:03:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:03:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:03:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 08:03:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:03:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 08:03:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:03:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:03:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:03:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:03:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:03:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:03:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:03:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:03:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:03:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 08:03:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 08:03:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 08:03:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 08:03:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 08:03:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-11 08:03:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:03:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190842307] [2024-10-11 08:03:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190842307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:03:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704904238] [2024-10-11 08:03:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:03:42,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:03:42,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:03:42,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:03:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:42,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:03:42,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1952 proven. 45 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2024-10-11 08:03:42,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:03:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-11 08:03:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704904238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:03:43,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:03:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-11 08:03:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343244011] [2024-10-11 08:03:43,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:03:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 08:03:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:03:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 08:03:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 08:03:43,005 INFO L87 Difference]: Start difference. First operand 165 states and 265 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) [2024-10-11 08:03:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:43,314 INFO L93 Difference]: Finished difference Result 341 states and 539 transitions. [2024-10-11 08:03:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:03:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) Word has length 229 [2024-10-11 08:03:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:43,317 INFO L225 Difference]: With dead ends: 341 [2024-10-11 08:03:43,317 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 08:03:43,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-10-11 08:03:43,319 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:43,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 257 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:03:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 08:03:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-10-11 08:03:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:03:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2024-10-11 08:03:43,342 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 229 [2024-10-11 08:03:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:43,342 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2024-10-11 08:03:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) [2024-10-11 08:03:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2024-10-11 08:03:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 08:03:43,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:43,345 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:43,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:03:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:03:43,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -641478906, now seen corresponding path program 1 times [2024-10-11 08:03:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:03:43,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443237690] [2024-10-11 08:03:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:03:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:03:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558058161] [2024-10-11 08:03:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:43,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:03:43,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:03:43,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:03:43,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:03:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:03:43,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:03:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:03:43,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:03:43,904 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:03:43,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:03:43,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:03:44,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:03:44,113 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 08:03:44,233 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:03:44,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:03:44 BoogieIcfgContainer [2024-10-11 08:03:44,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:03:44,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:03:44,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:03:44,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:03:44,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:03:40" (3/4) ... [2024-10-11 08:03:44,238 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:03:44,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:03:44,239 INFO L158 Benchmark]: Toolchain (without parser) took 4607.50ms. Allocated memory was 167.8MB in the beginning and 270.5MB in the end (delta: 102.8MB). Free memory was 95.8MB in the beginning and 222.3MB in the end (delta: -126.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:03:44,240 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:03:44,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 79.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 08:03:44,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.49ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 138.7MB in the end (delta: -58.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-11 08:03:44,240 INFO L158 Benchmark]: Boogie Preprocessor took 35.79ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 135.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:03:44,240 INFO L158 Benchmark]: RCFGBuilder took 430.66ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 109.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 08:03:44,241 INFO L158 Benchmark]: TraceAbstraction took 3804.21ms. Allocated memory was 167.8MB in the beginning and 270.5MB in the end (delta: 102.8MB). Free memory was 109.3MB in the beginning and 222.3MB in the end (delta: -113.0MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2024-10-11 08:03:44,241 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 270.5MB. Free memory is still 222.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:03:44,242 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.13ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 79.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.49ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 138.7MB in the end (delta: -58.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.79ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 135.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.66ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 109.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3804.21ms. Allocated memory was 167.8MB in the beginning and 270.5MB in the end (delta: 102.8MB). Free memory was 109.3MB in the beginning and 222.3MB in the end (delta: -113.0MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 270.5MB. Free memory is still 222.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] double var_1_30 = 64.25; [L46] signed short int var_1_31 = 10; [L47] signed short int var_1_32 = 0; [L48] signed short int var_1_33 = 8; [L49] unsigned char var_1_34 = 1; [L50] unsigned char var_1_35 = 0; [L51] unsigned short int var_1_36 = 5; [L52] signed long int var_1_37 = -1; [L53] signed long int var_1_38 = 5; [L54] unsigned short int var_1_39 = 100; [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] FCALL updateLastVariables() [L180] CALL updateVariables() [L108] var_1_6 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] var_1_7 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L115] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L117] var_1_10 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L119] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L119] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L120] var_1_12 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L121] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L122] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L122] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L123] var_1_13 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L124] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L125] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L125] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L126] var_1_14 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L127] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L128] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L128] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L129] var_1_15 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L131] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L131] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L132] var_1_16 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L134] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L134] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L135] var_1_17 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L137] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L137] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L138] var_1_19 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L139] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L140] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L140] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L141] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L141] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L142] var_1_22 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L143] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L144] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L144] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L145] var_1_24 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L146] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L147] var_1_25 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L148] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L149] var_1_26 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L150] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L151] var_1_30 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L152] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L153] var_1_32 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_32 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L154] RET assume_abort_if_not(var_1_32 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L155] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L155] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L156] var_1_35 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L157] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L158] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L158] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L159] var_1_37 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_37 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L160] RET assume_abort_if_not(var_1_37 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L161] CALL assume_abort_if_not(var_1_37 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L161] RET assume_abort_if_not(var_1_37 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L162] var_1_38 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L163] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L164] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L164] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L165] var_1_39 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L166] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L167] CALL assume_abort_if_not(var_1_39 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L167] RET assume_abort_if_not(var_1_39 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L180] RET updateVariables() [L181] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_32 [L61] var_1_34 = var_1_35 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L62] COND FALSE !((var_1_37 - var_1_38) <= var_1_31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L67] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L68] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L69] COND FALSE !(var_1_10 <= var_1_17) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L75] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L76] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L78] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L83] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L84] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16381, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L88] COND FALSE !(\read(var_1_18)) [L91] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16381, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L93] COND TRUE \read(var_1_1) [L94] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16381, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16381, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16381, var_1_22=16382, var_1_23=158/5, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 344 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 743 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1376 NumberOfCodeBlocks, 1376 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 2409 SizeOfPredicates, 3 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 14685/14820 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-11 08:03:44,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:03:46,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:03:46,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:03:46,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:03:46,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:03:46,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:03:46,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:03:46,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:03:46,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:03:46,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:03:46,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:03:46,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:03:46,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:03:46,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:03:46,204 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:03:46,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:03:46,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:03:46,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:03:46,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:03:46,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:03:46,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:03:46,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:03:46,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:03:46,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:03:46,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:03:46,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:03:46,210 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:03:46,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:03:46,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:03:46,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:03:46,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:03:46,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:03:46,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:03:46,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:03:46,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:03:46,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:03:46,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:03:46,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:03:46,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:03:46,214 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:03:46,214 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-clean/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-clean/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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2024-10-11 08:03:46,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:03:46,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:03:46,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:03:46,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:03:46,486 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:03:46,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:47,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:03:47,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:03:47,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:47,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7017a4ed7/16447498a1c14e8695c8c09fb3ccfb98/FLAGa68b81fea [2024-10-11 08:03:47,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7017a4ed7/16447498a1c14e8695c8c09fb3ccfb98 [2024-10-11 08:03:47,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:03:47,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:03:47,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:03:47,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:03:47,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:03:47,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:03:47" (1/1) ... [2024-10-11 08:03:47,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdd4573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:47, skipping insertion in model container [2024-10-11 08:03:47,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:03:47" (1/1) ... [2024-10-11 08:03:48,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:03:48,150 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2024-10-11 08:03:48,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:03:48,230 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:03:48,241 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2024-10-11 08:03:48,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:03:48,294 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:03:48,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48 WrapperNode [2024-10-11 08:03:48,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:03:48,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:03:48,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:03:48,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:03:48,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,344 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-11 08:03:48,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:03:48,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:03:48,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:03:48,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:03:48,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,377 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-11 08:03:48,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:03:48,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:03:48,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:03:48,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:03:48,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (1/1) ... [2024-10-11 08:03:48,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:03:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:03:48,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:03:48,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:03:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:03:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:03:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:03:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:03:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:03:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:03:48,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:03:48,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:03:49,906 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 08:03:49,906 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:03:49,946 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:03:49,947 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:03:49,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:03:49 BoogieIcfgContainer [2024-10-11 08:03:49,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:03:49,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:03:49,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:03:49,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:03:49,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:03:47" (1/3) ... [2024-10-11 08:03:49,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a26f109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:03:49, skipping insertion in model container [2024-10-11 08:03:49,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:03:48" (2/3) ... [2024-10-11 08:03:49,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a26f109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:03:49, skipping insertion in model container [2024-10-11 08:03:49,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:03:49" (3/3) ... [2024-10-11 08:03:49,967 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-10-11 08:03:49,978 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:03:49,978 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:03:50,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:03:50,030 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;@2d0a9532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:03:50,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:03:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:03:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:50,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:50,045 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:50,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -64128461, now seen corresponding path program 1 times [2024-10-11 08:03:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717942076] [2024-10-11 08:03:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:50,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:03:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:50,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:03:50,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:03:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:50,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:03:50,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-10-11 08:03:50,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:03:50,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717942076] [2024-10-11 08:03:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717942076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:03:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:03:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645235135] [2024-10-11 08:03:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:03:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:03:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:03:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:03:50,547 INFO L87 Difference]: Start difference. First operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-11 08:03:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:51,218 INFO L93 Difference]: Finished difference Result 169 states and 315 transitions. [2024-10-11 08:03:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:03:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 229 [2024-10-11 08:03:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:51,243 INFO L225 Difference]: With dead ends: 169 [2024-10-11 08:03:51,243 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 08:03:51,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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-11 08:03:51,248 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:51,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:03:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 08:03:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 08:03:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:03:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2024-10-11 08:03:51,283 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 229 [2024-10-11 08:03:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:51,284 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2024-10-11 08:03:51,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-11 08:03:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-10-11 08:03:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:51,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:51,289 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:51,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:03:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:03:51,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -542001939, now seen corresponding path program 1 times [2024-10-11 08:03:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739948009] [2024-10-11 08:03:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:51,492 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-11 08:03:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:51,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:03:51,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:03:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:51,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:03:51,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-10-11 08:03:52,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:03:52,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739948009] [2024-10-11 08:03:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739948009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:03:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892832385] [2024-10-11 08:03:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:03:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:03:52,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:03:52,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 08:03:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:52,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:03:52,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-11 08:03:52,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:03:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1892832385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:52,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:03:52,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 08:03:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235846494] [2024-10-11 08:03:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:03:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:03:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:03:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:03:52,918 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:53,639 INFO L93 Difference]: Finished difference Result 250 states and 400 transitions. [2024-10-11 08:03:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:03:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 229 [2024-10-11 08:03:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:53,643 INFO L225 Difference]: With dead ends: 250 [2024-10-11 08:03:53,643 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 08:03:53,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:03:53,651 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:53,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 08:03:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 08:03:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-10-11 08:03:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:03:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 265 transitions. [2024-10-11 08:03:53,717 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 265 transitions. Word has length 229 [2024-10-11 08:03:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:53,718 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 265 transitions. [2024-10-11 08:03:53,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 265 transitions. [2024-10-11 08:03:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:53,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:53,721 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:53,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 08:03:53,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 08:03:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:03:54,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -540154897, now seen corresponding path program 1 times [2024-10-11 08:03:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541035140] [2024-10-11 08:03:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:54,124 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-11 08:03:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:54,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:03:54,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:03:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:54,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:03:54,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-10-11 08:03:54,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:03:54,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541035140] [2024-10-11 08:03:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541035140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:03:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78888532] [2024-10-11 08:03:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:03:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:03:54,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:03:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 08:03:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:55,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:03:55,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-11 08:03:55,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:03:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [78888532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:03:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 08:03:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451861899] [2024-10-11 08:03:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:03:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:03:55,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:03:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:03:55,352 INFO L87 Difference]: Start difference. First operand 165 states and 265 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:56,788 INFO L93 Difference]: Finished difference Result 491 states and 789 transitions. [2024-10-11 08:03:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:03:56,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 229 [2024-10-11 08:03:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:56,796 INFO L225 Difference]: With dead ends: 491 [2024-10-11 08:03:56,796 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 08:03:56,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:03:56,797 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 126 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:56,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 367 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 08:03:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 08:03:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2024-10-11 08:03:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-11 08:03:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 520 transitions. [2024-10-11 08:03:56,847 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 520 transitions. Word has length 229 [2024-10-11 08:03:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:56,848 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 520 transitions. [2024-10-11 08:03:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-11 08:03:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 520 transitions. [2024-10-11 08:03:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 08:03:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:56,850 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:03:56,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-11 08:03:57,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 08:03:57,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/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-11 08:03:57,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash -482896595, now seen corresponding path program 1 times [2024-10-11 08:03:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509929970] [2024-10-11 08:03:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:57,253 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-11 08:03:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:57,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 08:03:57,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 08:03:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:57,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:03:57,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-10-11 08:03:57,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:03:57,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509929970] [2024-10-11 08:03:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509929970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:03:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [150132649] [2024-10-11 08:03:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:03:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:03:57,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:03:57,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 08:03:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:58,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:03:58,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:04:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1338 proven. 36 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2024-10-11 08:04:00,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:04:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-11 08:04:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [150132649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:04:00,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:04:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-10-11 08:04:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989030778] [2024-10-11 08:04:00,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:04:00,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 08:04:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:04:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 08:04:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:04:00,501 INFO L87 Difference]: Start difference. First operand 325 states and 520 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2024-10-11 08:04:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:04:09,457 INFO L93 Difference]: Finished difference Result 879 states and 1360 transitions. [2024-10-11 08:04:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 08:04:09,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 229 [2024-10-11 08:04:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:04:09,462 INFO L225 Difference]: With dead ends: 879 [2024-10-11 08:04:09,463 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 08:04:09,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 08:04:09,464 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 376 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:04:09,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 321 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-10-11 08:04:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 08:04:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 361. [2024-10-11 08:04:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 192 states have (on average 1.21875) internal successors, (234), 192 states have internal predecessors, (234), 156 states have call successors, (156), 12 states have call predecessors, (156), 12 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-11 08:04:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2024-10-11 08:04:09,517 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 229 [2024-10-11 08:04:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:04:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2024-10-11 08:04:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2024-10-11 08:04:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2024-10-11 08:04:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 08:04:09,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:04:09,522 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:04:09,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Ended with exit code 0 [2024-10-11 08:04:09,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 08:04:09,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:04:09,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:04:09,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:04:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1264278974, now seen corresponding path program 1 times [2024-10-11 08:04:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:04:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192320346] [2024-10-11 08:04:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:04:09,925 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-11 08:04:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:04:09,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 08:04:09,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 08:04:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:04:10,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 08:04:10,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:04:25,705 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-10-11 08:05:13,495 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 74 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)