/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/xcsp/Dubois-020.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:52:26,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:52:26,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:52:27,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:52:27,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:52:27,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:52:27,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:52:27,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:52:27,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:52:27,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:52:27,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:52:27,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:52:27,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:52:27,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:52:27,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:52:27,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:52:27,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:52:27,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:52:27,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:52:27,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:52:27,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:52:27,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:52:27,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:52:27,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:52:27,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:52:27,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:52:27,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:52:27,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:52:27,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:52:27,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:52:27,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:52:27,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:52:27,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:52:27,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:52:27,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:52:27,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:52:27,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:52:27,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:52:27,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:52:27,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:52:27,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:52:27,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:52:27,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:52:27,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:52:27,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:52:27,105 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:52:27,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:52:27,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:52:27,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:52:27,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:52:27,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:52:27,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:52:27,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:52:27,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:52:27,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:52:27,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:52:27,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:52:27,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:52:27,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:52:27,280 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:52:27,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/Dubois-020.c [2022-01-10 01:52:27,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05ea9548/6edbe0206ac448fe98926edc650088ee/FLAG45da0e296 [2022-01-10 01:52:27,642 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:52:27,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-020.c [2022-01-10 01:52:27,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05ea9548/6edbe0206ac448fe98926edc650088ee/FLAG45da0e296 [2022-01-10 01:52:28,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05ea9548/6edbe0206ac448fe98926edc650088ee [2022-01-10 01:52:28,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:52:28,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:52:28,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:52:28,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:52:28,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:52:28,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744df904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28, skipping insertion in model container [2022-01-10 01:52:28,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:52:28,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:52:28,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-020.c[14400,14413] [2022-01-10 01:52:28,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:52:28,342 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:52:28,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-020.c[14400,14413] [2022-01-10 01:52:28,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:52:28,436 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:52:28,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28 WrapperNode [2022-01-10 01:52:28,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:52:28,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:52:28,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:52:28,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:52:28,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,497 INFO L137 Inliner]: procedures = 13, calls = 167, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-01-10 01:52:28,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:52:28,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:52:28,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:52:28,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:52:28,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:52:28,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:52:28,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:52:28,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:52:28,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (1/1) ... [2022-01-10 01:52:28,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:52:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:52:28,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:52:28,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:52:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:52:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:52:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:52:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:52:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-01-10 01:52:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-01-10 01:52:28,758 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:52:28,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:52:29,137 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:52:29,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:52:29,145 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:52:29,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:29 BoogieIcfgContainer [2022-01-10 01:52:29,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:52:29,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:52:29,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:52:29,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:52:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:52:28" (1/3) ... [2022-01-10 01:52:29,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d47d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:29, skipping insertion in model container [2022-01-10 01:52:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:28" (2/3) ... [2022-01-10 01:52:29,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d47d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:29, skipping insertion in model container [2022-01-10 01:52:29,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:29" (3/3) ... [2022-01-10 01:52:29,171 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-020.c [2022-01-10 01:52:29,174 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:52:29,174 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:52:29,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:52:29,260 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:52:29,260 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:52:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 160 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2022-01-10 01:52:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-01-10 01:52:29,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:52:29,319 INFO L514 BasicCegarLoop]: trace histogram [160, 160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:52:29,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:52:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:52:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1345418962, now seen corresponding path program 1 times [2022-01-10 01:52:29,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:52:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318816576] [2022-01-10 01:52:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:52:29,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:52:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:52:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:52:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:52:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:52:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:52:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:52:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:52:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:52:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:52:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:52:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:52:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:52:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:52:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:52:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:52:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:52:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:52:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:52:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:52:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:52:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-10 01:52:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-10 01:52:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-10 01:52:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-01-10 01:52:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-01-10 01:52:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 01:52:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:52:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:52:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:52:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:52:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-10 01:52:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:52:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:52:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-10 01:52:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-10 01:52:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-01-10 01:52:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:52:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-10 01:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-01-10 01:52:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-01-10 01:52:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-01-10 01:52:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-01-10 01:52:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-01-10 01:52:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-01-10 01:52:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-01-10 01:52:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-01-10 01:52:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-01-10 01:52:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-01-10 01:52:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-01-10 01:52:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-01-10 01:52:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-10 01:52:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-10 01:52:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-01-10 01:52:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-10 01:52:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-01-10 01:52:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-01-10 01:52:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-01-10 01:52:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-01-10 01:52:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-01-10 01:52:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-01-10 01:52:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-01-10 01:52:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-01-10 01:52:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-01-10 01:52:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-01-10 01:52:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-01-10 01:52:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-01-10 01:52:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-01-10 01:52:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-01-10 01:52:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2022-01-10 01:52:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-01-10 01:52:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-01-10 01:52:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-01-10 01:52:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2022-01-10 01:52:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2022-01-10 01:52:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-01-10 01:52:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-01-10 01:52:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2022-01-10 01:52:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2022-01-10 01:52:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-01-10 01:52:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-01-10 01:52:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-01-10 01:52:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2022-01-10 01:52:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-01-10 01:52:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2022-01-10 01:52:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-01-10 01:52:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-01-10 01:52:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2022-01-10 01:52:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-01-10 01:52:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-01-10 01:52:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-01-10 01:52:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2022-01-10 01:52:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2022-01-10 01:52:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2022-01-10 01:52:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2022-01-10 01:52:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2022-01-10 01:52:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2022-01-10 01:52:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2022-01-10 01:52:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2022-01-10 01:52:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2022-01-10 01:52:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2022-01-10 01:52:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2022-01-10 01:52:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2022-01-10 01:52:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2022-01-10 01:52:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2022-01-10 01:52:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2022-01-10 01:52:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 579 [2022-01-10 01:52:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2022-01-10 01:52:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-01-10 01:52:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596 [2022-01-10 01:52:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2022-01-10 01:52:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2022-01-10 01:52:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2022-01-10 01:52:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2022-01-10 01:52:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2022-01-10 01:52:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2022-01-10 01:52:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2022-01-10 01:52:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2022-01-10 01:52:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 645 [2022-01-10 01:52:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 651 [2022-01-10 01:52:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 656 [2022-01-10 01:52:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2022-01-10 01:52:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2022-01-10 01:52:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 672 [2022-01-10 01:52:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 677 [2022-01-10 01:52:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2022-01-10 01:52:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 687 [2022-01-10 01:52:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 692 [2022-01-10 01:52:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 697 [2022-01-10 01:52:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 702 [2022-01-10 01:52:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2022-01-10 01:52:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 712 [2022-01-10 01:52:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-01-10 01:52:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2022-01-10 01:52:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 727 [2022-01-10 01:52:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 732 [2022-01-10 01:52:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2022-01-10 01:52:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2022-01-10 01:52:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2022-01-10 01:52:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 752 [2022-01-10 01:52:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 757 [2022-01-10 01:52:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 762 [2022-01-10 01:52:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 767 [2022-01-10 01:52:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 772 [2022-01-10 01:52:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 777 [2022-01-10 01:52:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 782 [2022-01-10 01:52:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 787 [2022-01-10 01:52:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 792 [2022-01-10 01:52:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 797 [2022-01-10 01:52:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 802 [2022-01-10 01:52:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2022-01-10 01:52:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 812 [2022-01-10 01:52:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 817 [2022-01-10 01:52:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 822 [2022-01-10 01:52:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 827 [2022-01-10 01:52:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2022-01-10 01:52:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2022-01-10 01:52:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2022-01-10 01:52:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2022-01-10 01:52:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 852 [2022-01-10 01:52:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 857 [2022-01-10 01:52:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 50880 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50880 trivial. 0 not checked. [2022-01-10 01:52:30,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:52:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318816576] [2022-01-10 01:52:30,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318816576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:52:30,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:52:30,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:52:30,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568531048] [2022-01-10 01:52:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:52:30,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:52:30,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:52:30,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:52:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:52:30,369 INFO L87 Difference]: Start difference. First operand has 231 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 160 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 1 states have call predecessors, (160), 2 states have call successors, (160) [2022-01-10 01:52:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:52:30,437 INFO L93 Difference]: Finished difference Result 456 states and 934 transitions. [2022-01-10 01:52:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:52:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 1 states have call predecessors, (160), 2 states have call successors, (160) Word has length 863 [2022-01-10 01:52:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:52:30,450 INFO L225 Difference]: With dead ends: 456 [2022-01-10 01:52:30,451 INFO L226 Difference]: Without dead ends: 228 [2022-01-10 01:52:30,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:52:30,464 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:52:30,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:52:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-01-10 01:52:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-01-10 01:52:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 66 states have (on average 1.0) internal successors, (66), 66 states have internal predecessors, (66), 160 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2022-01-10 01:52:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2022-01-10 01:52:30,544 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 863 [2022-01-10 01:52:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:52:30,545 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2022-01-10 01:52:30,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (160), 1 states have call predecessors, (160), 1 states have return successors, (160), 1 states have call predecessors, (160), 2 states have call successors, (160) [2022-01-10 01:52:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2022-01-10 01:52:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-01-10 01:52:30,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:52:30,562 INFO L514 BasicCegarLoop]: trace histogram [160, 160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:52:30,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:52:30,563 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:52:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:52:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1789694510, now seen corresponding path program 1 times [2022-01-10 01:52:30,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:52:30,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668371079] [2022-01-10 01:52:30,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:52:30,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:52:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:52:30,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:52:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:52:31,171 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:52:31,171 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:52:31,172 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:52:31,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:52:31,182 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-10 01:52:31,198 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:52:31,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:52:31 BoogieIcfgContainer [2022-01-10 01:52:31,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:52:31,508 INFO L158 Benchmark]: Toolchain (without parser) took 3442.06ms. Allocated memory was 168.8MB in the beginning and 222.3MB in the end (delta: 53.5MB). Free memory was 117.9MB in the beginning and 93.6MB in the end (delta: 24.3MB). Peak memory consumption was 78.3MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,508 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:52:31,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.76ms. Allocated memory was 168.8MB in the beginning and 222.3MB in the end (delta: 53.5MB). Free memory was 117.7MB in the beginning and 187.0MB in the end (delta: -69.3MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.33ms. Allocated memory is still 222.3MB. Free memory was 187.0MB in the beginning and 181.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,512 INFO L158 Benchmark]: Boogie Preprocessor took 78.34ms. Allocated memory is still 222.3MB. Free memory was 181.2MB in the beginning and 178.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,512 INFO L158 Benchmark]: RCFGBuilder took 568.56ms. Allocated memory is still 222.3MB. Free memory was 178.1MB in the beginning and 155.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,512 INFO L158 Benchmark]: TraceAbstraction took 2344.86ms. Allocated memory is still 222.3MB. Free memory was 155.1MB in the beginning and 93.6MB in the end (delta: 61.4MB). Peak memory consumption was 62.1MB. Max. memory is 8.0GB. [2022-01-10 01:52:31,513 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.76ms. Allocated memory was 168.8MB in the beginning and 222.3MB in the end (delta: 53.5MB). Free memory was 117.7MB in the beginning and 187.0MB in the end (delta: -69.3MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.33ms. Allocated memory is still 222.3MB. Free memory was 187.0MB in the beginning and 181.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.34ms. Allocated memory is still 222.3MB. Free memory was 181.2MB in the beginning and 178.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.56ms. Allocated memory is still 222.3MB. Free memory was 178.1MB in the beginning and 155.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2344.86ms. Allocated memory is still 222.3MB. Free memory was 155.1MB in the beginning and 93.6MB in the end (delta: 61.4MB). Peak memory consumption was 62.1MB. Max. memory is 8.0GB. * 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: 426]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 422. Possible FailurePath: [L22] int cond0; [L23] int dummy = 0; [L24] int N; [L25] int var0; [L26] var0 = __VERIFIER_nondet_int() [L27] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) VAL [dummy=0, var0=1] [L28] CALL assume(var0 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) VAL [dummy=0, var0=1] [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) VAL [dummy=0, var0=1, var1=0] [L32] CALL assume(var1 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) VAL [dummy=0, var0=1, var1=0] [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1] [L36] CALL assume(var2 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1] [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0] [L40] CALL assume(var3 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0] [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0] [L44] CALL assume(var4 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0] [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1] [L48] CALL assume(var5 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1] [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0] [L56] CALL assume(var7 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0] [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0] [L60] CALL assume(var8 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0] [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L64] CALL assume(var9 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) VAL [dummy=0, var0=1, var1=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L68] CALL assume(var10 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L72] CALL assume(var11 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L76] CALL assume(var12 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L80] CALL assume(var13 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L84] CALL assume(var14 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L88] CALL assume(var15 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L92] CALL assume(var16 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L96] CALL assume(var17 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L100] CALL assume(var18 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L104] CALL assume(var19 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L108] CALL assume(var20 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L112] CALL assume(var21 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L116] CALL assume(var22 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L120] CALL assume(var23 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L124] CALL assume(var24 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L128] CALL assume(var25 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L132] CALL assume(var26 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L136] CALL assume(var27 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L140] CALL assume(var28 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L144] CALL assume(var29 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L148] CALL assume(var30 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L152] CALL assume(var31 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L156] CALL assume(var32 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L160] CALL assume(var33 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L164] CALL assume(var34 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L168] CALL assume(var35 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L172] CALL assume(var36 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L176] CALL assume(var37 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L180] CALL assume(var38 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L184] CALL assume(var39 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L188] CALL assume(var40 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L192] CALL assume(var41 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L196] CALL assume(var42 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L200] CALL assume(var43 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L204] CALL assume(var44 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L205] int var45; [L206] var45 = __VERIFIER_nondet_int() [L207] CALL assume(var45 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var45 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L208] CALL assume(var45 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var45 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L209] int var46; [L210] var46 = __VERIFIER_nondet_int() [L211] CALL assume(var46 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var46 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L212] CALL assume(var46 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var46 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L213] int var47; [L214] var47 = __VERIFIER_nondet_int() [L215] CALL assume(var47 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var47 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L216] CALL assume(var47 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L216] RET assume(var47 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L217] int var48; [L218] var48 = __VERIFIER_nondet_int() [L219] CALL assume(var48 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L219] RET assume(var48 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L220] CALL assume(var48 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L220] RET assume(var48 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var5=1, var6=1, var7=0, var8=0, var9=1] [L221] int var49; [L222] var49 = __VERIFIER_nondet_int() [L223] CALL assume(var49 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L223] RET assume(var49 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L224] CALL assume(var49 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var49 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var6=1, var7=0, var8=0, var9=1] [L225] int var50; [L226] var50 = __VERIFIER_nondet_int() [L227] CALL assume(var50 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var50 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=1] [L228] CALL assume(var50 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L228] RET assume(var50 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=1] [L229] int var51; [L230] var51 = __VERIFIER_nondet_int() [L231] CALL assume(var51 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L231] RET assume(var51 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var6=1, var7=0, var8=0, var9=1] [L232] CALL assume(var51 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L232] RET assume(var51 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var6=1, var7=0, var8=0, var9=1] [L233] int var52; [L234] var52 = __VERIFIER_nondet_int() [L235] CALL assume(var52 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L235] RET assume(var52 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var6=1, var7=0, var8=0, var9=1] [L236] CALL assume(var52 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L236] RET assume(var52 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var6=1, var7=0, var8=0, var9=1] [L237] int var53; [L238] var53 = __VERIFIER_nondet_int() [L239] CALL assume(var53 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L239] RET assume(var53 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var6=1, var7=0, var8=0, var9=1] [L240] CALL assume(var53 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L240] RET assume(var53 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var6=1, var7=0, var8=0, var9=1] [L241] int var54; [L242] var54 = __VERIFIER_nondet_int() [L243] CALL assume(var54 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L243] RET assume(var54 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var6=1, var7=0, var8=0, var9=1] [L244] CALL assume(var54 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L244] RET assume(var54 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var6=1, var7=0, var8=0, var9=1] [L245] int var55; [L246] var55 = __VERIFIER_nondet_int() [L247] CALL assume(var55 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L247] RET assume(var55 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var6=1, var7=0, var8=0, var9=1] [L248] CALL assume(var55 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L248] RET assume(var55 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var6=1, var7=0, var8=0, var9=1] [L249] int var56; [L250] var56 = __VERIFIER_nondet_int() [L251] CALL assume(var56 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L251] RET assume(var56 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var6=1, var7=0, var8=0, var9=1] [L252] CALL assume(var56 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L252] RET assume(var56 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var6=1, var7=0, var8=0, var9=1] [L253] int var57; [L254] var57 = __VERIFIER_nondet_int() [L255] CALL assume(var57 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L255] RET assume(var57 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var6=1, var7=0, var8=0, var9=1] [L256] CALL assume(var57 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L256] RET assume(var57 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var6=1, var7=0, var8=0, var9=1] [L257] int var58; [L258] var58 = __VERIFIER_nondet_int() [L259] CALL assume(var58 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L259] RET assume(var58 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var6=1, var7=0, var8=0, var9=1] [L260] CALL assume(var58 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L260] RET assume(var58 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var6=1, var7=0, var8=0, var9=1] [L261] int var59; [L262] var59 = __VERIFIER_nondet_int() [L263] CALL assume(var59 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L263] RET assume(var59 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L264] CALL assume(var59 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L264] RET assume(var59 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L265] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L266-L269] CALL assume((var38 == 0 & var39 == 0 & var0 == 1) | (var38 == 0 & var39 == 1 & var0 == 0) | (var38 == 1 & var39 == 0 & var0 == 0) | (var38 == 1 & var39 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=82, cond=82] [L266-L269] RET assume((var38 == 0 & var39 == 0 & var0 == 1) | (var38 == 0 & var39 == 1 & var0 == 0) | (var38 == 1 & var39 == 0 & var0 == 0) | (var38 == 1 & var39 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L270-L273] CALL assume((var1 == 0 & var41 == 0 & var2 == 1) | (var1 == 0 & var41 == 1 & var2 == 0) | (var1 == 1 & var41 == 0 & var2 == 0) | (var1 == 1 & var41 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L270-L273] RET assume((var1 == 0 & var41 == 0 & var2 == 1) | (var1 == 0 & var41 == 1 & var2 == 0) | (var1 == 1 & var41 == 0 & var2 == 0) | (var1 == 1 & var41 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L274-L277] CALL assume((var2 == 0 & var42 == 0 & var3 == 1) | (var2 == 0 & var42 == 1 & var3 == 0) | (var2 == 1 & var42 == 0 & var3 == 0) | (var2 == 1 & var42 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L274-L277] RET assume((var2 == 0 & var42 == 0 & var3 == 1) | (var2 == 0 & var42 == 1 & var3 == 0) | (var2 == 1 & var42 == 0 & var3 == 0) | (var2 == 1 & var42 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L278-L281] CALL assume((var3 == 0 & var43 == 0 & var4 == 1) | (var3 == 0 & var43 == 1 & var4 == 0) | (var3 == 1 & var43 == 0 & var4 == 0) | (var3 == 1 & var43 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L278-L281] RET assume((var3 == 0 & var43 == 0 & var4 == 1) | (var3 == 0 & var43 == 1 & var4 == 0) | (var3 == 1 & var43 == 0 & var4 == 0) | (var3 == 1 & var43 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L282-L285] CALL assume((var4 == 0 & var44 == 0 & var5 == 1) | (var4 == 0 & var44 == 1 & var5 == 0) | (var4 == 1 & var44 == 0 & var5 == 0) | (var4 == 1 & var44 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L282-L285] RET assume((var4 == 0 & var44 == 0 & var5 == 1) | (var4 == 0 & var44 == 1 & var5 == 0) | (var4 == 1 & var44 == 0 & var5 == 0) | (var4 == 1 & var44 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L286-L289] CALL assume((var5 == 0 & var45 == 0 & var6 == 1) | (var5 == 0 & var45 == 1 & var6 == 0) | (var5 == 1 & var45 == 0 & var6 == 0) | (var5 == 1 & var45 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L286-L289] RET assume((var5 == 0 & var45 == 0 & var6 == 1) | (var5 == 0 & var45 == 1 & var6 == 0) | (var5 == 1 & var45 == 0 & var6 == 0) | (var5 == 1 & var45 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L290-L293] CALL assume((var6 == 0 & var46 == 0 & var7 == 1) | (var6 == 0 & var46 == 1 & var7 == 0) | (var6 == 1 & var46 == 0 & var7 == 0) | (var6 == 1 & var46 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L290-L293] RET assume((var6 == 0 & var46 == 0 & var7 == 1) | (var6 == 0 & var46 == 1 & var7 == 0) | (var6 == 1 & var46 == 0 & var7 == 0) | (var6 == 1 & var46 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L294-L297] CALL assume((var7 == 0 & var47 == 0 & var8 == 1) | (var7 == 0 & var47 == 1 & var8 == 0) | (var7 == 1 & var47 == 0 & var8 == 0) | (var7 == 1 & var47 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L294-L297] RET assume((var7 == 0 & var47 == 0 & var8 == 1) | (var7 == 0 & var47 == 1 & var8 == 0) | (var7 == 1 & var47 == 0 & var8 == 0) | (var7 == 1 & var47 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L298-L301] CALL assume((var8 == 0 & var48 == 0 & var9 == 1) | (var8 == 0 & var48 == 1 & var9 == 0) | (var8 == 1 & var48 == 0 & var9 == 0) | (var8 == 1 & var48 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L298-L301] RET assume((var8 == 0 & var48 == 0 & var9 == 1) | (var8 == 0 & var48 == 1 & var9 == 0) | (var8 == 1 & var48 == 0 & var9 == 0) | (var8 == 1 & var48 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L302-L305] CALL assume((var9 == 0 & var49 == 0 & var10 == 1) | (var9 == 0 & var49 == 1 & var10 == 0) | (var9 == 1 & var49 == 0 & var10 == 0) | (var9 == 1 & var49 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L302-L305] RET assume((var9 == 0 & var49 == 0 & var10 == 1) | (var9 == 0 & var49 == 1 & var10 == 0) | (var9 == 1 & var49 == 0 & var10 == 0) | (var9 == 1 & var49 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L306-L309] CALL assume((var10 == 0 & var50 == 0 & var11 == 1) | (var10 == 0 & var50 == 1 & var11 == 0) | (var10 == 1 & var50 == 0 & var11 == 0) | (var10 == 1 & var50 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L306-L309] RET assume((var10 == 0 & var50 == 0 & var11 == 1) | (var10 == 0 & var50 == 1 & var11 == 0) | (var10 == 1 & var50 == 0 & var11 == 0) | (var10 == 1 & var50 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L310-L313] CALL assume((var11 == 0 & var51 == 0 & var12 == 1) | (var11 == 0 & var51 == 1 & var12 == 0) | (var11 == 1 & var51 == 0 & var12 == 0) | (var11 == 1 & var51 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=86, cond=86] [L310-L313] RET assume((var11 == 0 & var51 == 0 & var12 == 1) | (var11 == 0 & var51 == 1 & var12 == 0) | (var11 == 1 & var51 == 0 & var12 == 0) | (var11 == 1 & var51 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L314-L317] CALL assume((var12 == 0 & var52 == 0 & var13 == 1) | (var12 == 0 & var52 == 1 & var13 == 0) | (var12 == 1 & var52 == 0 & var13 == 0) | (var12 == 1 & var52 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=84, cond=84] [L314-L317] RET assume((var12 == 0 & var52 == 0 & var13 == 1) | (var12 == 0 & var52 == 1 & var13 == 0) | (var12 == 1 & var52 == 0 & var13 == 0) | (var12 == 1 & var52 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L318-L321] CALL assume((var13 == 0 & var53 == 0 & var14 == 1) | (var13 == 0 & var53 == 1 & var14 == 0) | (var13 == 1 & var53 == 0 & var14 == 0) | (var13 == 1 & var53 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L318-L321] RET assume((var13 == 0 & var53 == 0 & var14 == 1) | (var13 == 0 & var53 == 1 & var14 == 0) | (var13 == 1 & var53 == 0 & var14 == 0) | (var13 == 1 & var53 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L322-L325] CALL assume((var14 == 0 & var54 == 0 & var15 == 1) | (var14 == 0 & var54 == 1 & var15 == 0) | (var14 == 1 & var54 == 0 & var15 == 0) | (var14 == 1 & var54 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L322-L325] RET assume((var14 == 0 & var54 == 0 & var15 == 1) | (var14 == 0 & var54 == 1 & var15 == 0) | (var14 == 1 & var54 == 0 & var15 == 0) | (var14 == 1 & var54 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L326-L329] CALL assume((var15 == 0 & var55 == 0 & var16 == 1) | (var15 == 0 & var55 == 1 & var16 == 0) | (var15 == 1 & var55 == 0 & var16 == 0) | (var15 == 1 & var55 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L326-L329] RET assume((var15 == 0 & var55 == 0 & var16 == 1) | (var15 == 0 & var55 == 1 & var16 == 0) | (var15 == 1 & var55 == 0 & var16 == 0) | (var15 == 1 & var55 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L330-L333] CALL assume((var16 == 0 & var56 == 0 & var17 == 1) | (var16 == 0 & var56 == 1 & var17 == 0) | (var16 == 1 & var56 == 0 & var17 == 0) | (var16 == 1 & var56 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L330-L333] RET assume((var16 == 0 & var56 == 0 & var17 == 1) | (var16 == 0 & var56 == 1 & var17 == 0) | (var16 == 1 & var56 == 0 & var17 == 0) | (var16 == 1 & var56 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L334-L337] CALL assume((var17 == 0 & var57 == 0 & var18 == 1) | (var17 == 0 & var57 == 1 & var18 == 0) | (var17 == 1 & var57 == 0 & var18 == 0) | (var17 == 1 & var57 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L334-L337] RET assume((var17 == 0 & var57 == 0 & var18 == 1) | (var17 == 0 & var57 == 1 & var18 == 0) | (var17 == 1 & var57 == 0 & var18 == 0) | (var17 == 1 & var57 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L338-L341] CALL assume((var0 == 0 & var40 == 0 & var1 == 1) | (var0 == 0 & var40 == 1 & var1 == 0) | (var0 == 1 & var40 == 0 & var1 == 0) | (var0 == 1 & var40 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=85, cond=85] [L338-L341] RET assume((var0 == 0 & var40 == 0 & var1 == 1) | (var0 == 0 & var40 == 1 & var1 == 0) | (var0 == 1 & var40 == 0 & var1 == 0) | (var0 == 1 & var40 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L342-L345] CALL assume((var19 == 0 & var58 == 0 & var59 == 1) | (var19 == 0 & var58 == 1 & var59 == 0) | (var19 == 1 & var58 == 0 & var59 == 0) | (var19 == 1 & var58 == 1 & var59 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L342-L345] RET assume((var19 == 0 & var58 == 0 & var59 == 1) | (var19 == 0 & var58 == 1 & var59 == 0) | (var19 == 1 & var58 == 0 & var59 == 0) | (var19 == 1 & var58 == 1 & var59 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L346-L349] CALL assume((var18 == 0 & var58 == 0 & var59 == 1) | (var18 == 0 & var58 == 1 & var59 == 0) | (var18 == 1 & var58 == 0 & var59 == 0) | (var18 == 1 & var58 == 1 & var59 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L346-L349] RET assume((var18 == 0 & var58 == 0 & var59 == 1) | (var18 == 0 & var58 == 1 & var59 == 0) | (var18 == 1 & var58 == 0 & var59 == 0) | (var18 == 1 & var58 == 1 & var59 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L350-L353] CALL assume((var21 == 0 & var56 == 0 & var20 == 1) | (var21 == 0 & var56 == 1 & var20 == 0) | (var21 == 1 & var56 == 0 & var20 == 0) | (var21 == 1 & var56 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L350-L353] RET assume((var21 == 0 & var56 == 0 & var20 == 1) | (var21 == 0 & var56 == 1 & var20 == 0) | (var21 == 1 & var56 == 0 & var20 == 0) | (var21 == 1 & var56 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L354-L357] CALL assume((var22 == 0 & var55 == 0 & var21 == 1) | (var22 == 0 & var55 == 1 & var21 == 0) | (var22 == 1 & var55 == 0 & var21 == 0) | (var22 == 1 & var55 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L354-L357] RET assume((var22 == 0 & var55 == 0 & var21 == 1) | (var22 == 0 & var55 == 1 & var21 == 0) | (var22 == 1 & var55 == 0 & var21 == 0) | (var22 == 1 & var55 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L358-L361] CALL assume((var23 == 0 & var54 == 0 & var22 == 1) | (var23 == 0 & var54 == 1 & var22 == 0) | (var23 == 1 & var54 == 0 & var22 == 0) | (var23 == 1 & var54 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=83, cond=83] [L358-L361] RET assume((var23 == 0 & var54 == 0 & var22 == 1) | (var23 == 0 & var54 == 1 & var22 == 0) | (var23 == 1 & var54 == 0 & var22 == 0) | (var23 == 1 & var54 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L362-L365] CALL assume((var24 == 0 & var53 == 0 & var23 == 1) | (var24 == 0 & var53 == 1 & var23 == 0) | (var24 == 1 & var53 == 0 & var23 == 0) | (var24 == 1 & var53 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=81, cond=81] [L362-L365] RET assume((var24 == 0 & var53 == 0 & var23 == 1) | (var24 == 0 & var53 == 1 & var23 == 0) | (var24 == 1 & var53 == 0 & var23 == 0) | (var24 == 1 & var53 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L366-L369] CALL assume((var25 == 0 & var52 == 0 & var24 == 1) | (var25 == 0 & var52 == 1 & var24 == 0) | (var25 == 1 & var52 == 0 & var24 == 0) | (var25 == 1 & var52 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L366-L369] RET assume((var25 == 0 & var52 == 0 & var24 == 1) | (var25 == 0 & var52 == 1 & var24 == 0) | (var25 == 1 & var52 == 0 & var24 == 0) | (var25 == 1 & var52 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L370-L373] CALL assume((var26 == 0 & var51 == 0 & var25 == 1) | (var26 == 0 & var51 == 1 & var25 == 0) | (var26 == 1 & var51 == 0 & var25 == 0) | (var26 == 1 & var51 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=88, cond=88] [L370-L373] RET assume((var26 == 0 & var51 == 0 & var25 == 1) | (var26 == 0 & var51 == 1 & var25 == 0) | (var26 == 1 & var51 == 0 & var25 == 0) | (var26 == 1 & var51 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L374-L377] CALL assume((var27 == 0 & var50 == 0 & var26 == 1) | (var27 == 0 & var50 == 1 & var26 == 0) | (var27 == 1 & var50 == 0 & var26 == 0) | (var27 == 1 & var50 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=79, cond=79] [L374-L377] RET assume((var27 == 0 & var50 == 0 & var26 == 1) | (var27 == 0 & var50 == 1 & var26 == 0) | (var27 == 1 & var50 == 0 & var26 == 0) | (var27 == 1 & var50 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L378-L381] CALL assume((var28 == 0 & var49 == 0 & var27 == 1) | (var28 == 0 & var49 == 1 & var27 == 0) | (var28 == 1 & var49 == 0 & var27 == 0) | (var28 == 1 & var49 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L378-L381] RET assume((var28 == 0 & var49 == 0 & var27 == 1) | (var28 == 0 & var49 == 1 & var27 == 0) | (var28 == 1 & var49 == 0 & var27 == 0) | (var28 == 1 & var49 == 1 & var27 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L382-L385] CALL assume((var29 == 0 & var48 == 0 & var28 == 1) | (var29 == 0 & var48 == 1 & var28 == 0) | (var29 == 1 & var48 == 0 & var28 == 0) | (var29 == 1 & var48 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L382-L385] RET assume((var29 == 0 & var48 == 0 & var28 == 1) | (var29 == 0 & var48 == 1 & var28 == 0) | (var29 == 1 & var48 == 0 & var28 == 0) | (var29 == 1 & var48 == 1 & var28 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L386-L389] CALL assume((var30 == 0 & var47 == 0 & var29 == 1) | (var30 == 0 & var47 == 1 & var29 == 0) | (var30 == 1 & var47 == 0 & var29 == 0) | (var30 == 1 & var47 == 1 & var29 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L386-L389] RET assume((var30 == 0 & var47 == 0 & var29 == 1) | (var30 == 0 & var47 == 1 & var29 == 0) | (var30 == 1 & var47 == 0 & var29 == 0) | (var30 == 1 & var47 == 1 & var29 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L390-L393] CALL assume((var31 == 0 & var46 == 0 & var30 == 1) | (var31 == 0 & var46 == 1 & var30 == 0) | (var31 == 1 & var46 == 0 & var30 == 0) | (var31 == 1 & var46 == 1 & var30 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L390-L393] RET assume((var31 == 0 & var46 == 0 & var30 == 1) | (var31 == 0 & var46 == 1 & var30 == 0) | (var31 == 1 & var46 == 0 & var30 == 0) | (var31 == 1 & var46 == 1 & var30 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L394-L397] CALL assume((var32 == 0 & var45 == 0 & var31 == 1) | (var32 == 0 & var45 == 1 & var31 == 0) | (var32 == 1 & var45 == 0 & var31 == 0) | (var32 == 1 & var45 == 1 & var31 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L394-L397] RET assume((var32 == 0 & var45 == 0 & var31 == 1) | (var32 == 0 & var45 == 1 & var31 == 0) | (var32 == 1 & var45 == 0 & var31 == 0) | (var32 == 1 & var45 == 1 & var31 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L398-L401] CALL assume((var33 == 0 & var44 == 0 & var32 == 1) | (var33 == 0 & var44 == 1 & var32 == 0) | (var33 == 1 & var44 == 0 & var32 == 0) | (var33 == 1 & var44 == 1 & var32 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L398-L401] RET assume((var33 == 0 & var44 == 0 & var32 == 1) | (var33 == 0 & var44 == 1 & var32 == 0) | (var33 == 1 & var44 == 0 & var32 == 0) | (var33 == 1 & var44 == 1 & var32 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L402-L405] CALL assume((var34 == 0 & var43 == 0 & var33 == 1) | (var34 == 0 & var43 == 1 & var33 == 0) | (var34 == 1 & var43 == 0 & var33 == 0) | (var34 == 1 & var43 == 1 & var33 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L402-L405] RET assume((var34 == 0 & var43 == 0 & var33 == 1) | (var34 == 0 & var43 == 1 & var33 == 0) | (var34 == 1 & var43 == 0 & var33 == 0) | (var34 == 1 & var43 == 1 & var33 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L406-L409] CALL assume((var35 == 0 & var42 == 0 & var34 == 1) | (var35 == 0 & var42 == 1 & var34 == 0) | (var35 == 1 & var42 == 0 & var34 == 0) | (var35 == 1 & var42 == 1 & var34 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L406-L409] RET assume((var35 == 0 & var42 == 0 & var34 == 1) | (var35 == 0 & var42 == 1 & var34 == 0) | (var35 == 1 & var42 == 0 & var34 == 0) | (var35 == 1 & var42 == 1 & var34 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L410-L413] CALL assume((var36 == 0 & var41 == 0 & var35 == 1) | (var36 == 0 & var41 == 1 & var35 == 0) | (var36 == 1 & var41 == 0 & var35 == 0) | (var36 == 1 & var41 == 1 & var35 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L410-L413] RET assume((var36 == 0 & var41 == 0 & var35 == 1) | (var36 == 0 & var41 == 1 & var35 == 0) | (var36 == 1 & var41 == 0 & var35 == 0) | (var36 == 1 & var41 == 1 & var35 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L414-L417] CALL assume((var37 == 0 & var40 == 0 & var36 == 1) | (var37 == 0 & var40 == 1 & var36 == 0) | (var37 == 1 & var40 == 0 & var36 == 0) | (var37 == 1 & var40 == 1 & var36 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=80, cond=80] [L414-L417] RET assume((var37 == 0 & var40 == 0 & var36 == 1) | (var37 == 0 & var40 == 1 & var36 == 0) | (var37 == 1 & var40 == 0 & var36 == 0) | (var37 == 1 & var40 == 1 & var36 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L418-L421] CALL assume((var20 == 0 & var57 == 0 & var19 == 1) | (var20 == 0 & var57 == 1 & var19 == 0) | (var20 == 1 & var57 == 0 & var19 == 0) | (var20 == 1 & var57 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=87, cond=87] [L418-L421] RET assume((var20 == 0 & var57 == 0 & var19 == 1) | (var20 == 0 & var57 == 1 & var19 == 0) | (var20 == 1 & var57 == 0 & var19 == 0) | (var20 == 1 & var57 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L422-L425] CALL assume((var38 == 0 & var39 == 0 & var37 == 0) | (var38 == 0 & var39 == 1 & var37 == 1) | (var38 == 1 & var39 == 0 & var37 == 1) | (var38 == 1 & var39 == 1 & var37 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L422-L425] RET assume((var38 == 0 & var39 == 0 & var37 == 0) | (var38 == 0 & var39 == 1 & var37 == 1) | (var38 == 1 & var39 == 0 & var37 == 1) | (var38 == 1 & var39 == 1 & var37 == 0) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] [L426] reach_error() VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=0, var19=0, var2=1, var20=0, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=0, var3=0, var30=0, var31=1, var32=1, var33=1, var34=0, var35=1, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=1, var42=1, var43=1, var44=1, var45=1, var46=0, var47=1, var48=1, var49=0, var5=1, var50=0, var51=0, var52=0, var53=1, var54=1, var55=1, var56=1, var57=1, var58=0, var59=0, var6=1, var7=0, var8=0, var9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 231 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 160, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 386 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1726 NumberOfCodeBlocks, 1726 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 50880/50880 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 [2022-01-10 01:52:31,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...