/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/xcsp/aim-100-2-0-sat-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:08:01,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:08:01,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:08:01,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:08:01,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:08:01,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:08:01,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:08:01,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:08:01,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:08:01,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:08:01,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:08:01,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:08:01,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:08:01,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:08:01,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:08:01,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:08:01,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:08:01,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:08:01,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:08:01,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:08:01,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:08:01,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:08:01,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:08:01,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:08:01,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:08:01,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:08:01,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:08:01,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:08:01,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:08:01,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:08:01,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:08:01,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:08:01,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:08:01,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:08:01,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:08:01,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:08:01,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:08:01,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:08:01,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:08:01,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:08:01,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:08:01,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:08:01,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:08:01,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:08:01,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:08:01,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:08:01,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:08:01,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:08:01,467 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:08:01,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:08:01,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:08:01,475 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:08:01,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:08:01,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:08:01,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:08:01,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:08:01,478 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:08:01,478 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 01:08:01,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:08:01,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:08:01,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:08:01,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:08:01,693 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:08:01,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/aim-100-2-0-sat-1.c [2022-01-11 01:08:01,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c862341/060c3661ab1543089cf848d7f4db02e4/FLAG40618ccfa [2022-01-11 01:08:02,128 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:08:02,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/aim-100-2-0-sat-1.c [2022-01-11 01:08:02,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c862341/060c3661ab1543089cf848d7f4db02e4/FLAG40618ccfa [2022-01-11 01:08:02,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c862341/060c3661ab1543089cf848d7f4db02e4 [2022-01-11 01:08:02,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:08:02,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:08:02,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:08:02,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:08:02,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:08:02,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd5da8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02, skipping insertion in model container [2022-01-11 01:08:02,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:08:02,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:08:02,446 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/aim-100-2-0-sat-1.c[21205,21218] [2022-01-11 01:08:02,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:08:02,473 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:08:02,526 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/aim-100-2-0-sat-1.c[21205,21218] [2022-01-11 01:08:02,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:08:02,549 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:08:02,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02 WrapperNode [2022-01-11 01:08:02,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:08:02,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:08:02,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:08:02,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:08:02,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,662 INFO L137 Inliner]: procedures = 13, calls = 401, calls flagged for inlining = 396, calls inlined = 396, statements flattened = 1893 [2022-01-11 01:08:02,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:08:02,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:08:02,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:08:02,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:08:02,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:08:02,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:08:02,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:08:02,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:08:02,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (1/1) ... [2022-01-11 01:08:02,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:08:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:08:02,799 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-11 01:08:02,837 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-11 01:08:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:08:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:08:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:08:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:08:02,995 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:08:02,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:08:03,960 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:08:03,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:08:03,980 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 01:08:03,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:08:03 BoogieIcfgContainer [2022-01-11 01:08:03,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:08:03,983 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:08:03,983 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:08:03,985 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:08:03,987 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:08:03" (1/1) ... [2022-01-11 01:08:04,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:08:04 BasicIcfg [2022-01-11 01:08:04,347 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:08:04,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:08:04,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:08:04,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:08:04,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:08:02" (1/4) ... [2022-01-11 01:08:04,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3c24a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:08:04, skipping insertion in model container [2022-01-11 01:08:04,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:08:02" (2/4) ... [2022-01-11 01:08:04,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3c24a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:08:04, skipping insertion in model container [2022-01-11 01:08:04,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:08:03" (3/4) ... [2022-01-11 01:08:04,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3c24a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:08:04, skipping insertion in model container [2022-01-11 01:08:04,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:08:04" (4/4) ... [2022-01-11 01:08:04,354 INFO L111 eAbstractionObserver]: Analyzing ICFG aim-100-2-0-sat-1.cTransformedIcfg [2022-01-11 01:08:04,358 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:08:04,358 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 01:08:04,402 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:08:04,413 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-11 01:08:04,413 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 01:08:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 793 states have (on average 1.4981084489281211) internal successors, (1188), 794 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:08:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2022-01-11 01:08:04,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:08:04,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:08:04,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:08:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:08:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1980176111, now seen corresponding path program 1 times [2022-01-11 01:08:04,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:08:04,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819846430] [2022-01-11 01:08:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:08:04,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:08:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:08:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:08:04,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:08:04,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819846430] [2022-01-11 01:08:04,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819846430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:08:04,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:08:04,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:08:04,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220967594] [2022-01-11 01:08:04,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:08:04,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 01:08:04,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:08:04,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 01:08:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 01:08:04,939 INFO L87 Difference]: Start difference. First operand has 795 states, 793 states have (on average 1.4981084489281211) internal successors, (1188), 794 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 395.5) internal successors, (791), 2 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:08:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:08:04,984 INFO L93 Difference]: Finished difference Result 1584 states and 2370 transitions. [2022-01-11 01:08:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 01:08:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 395.5) internal successors, (791), 2 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 791 [2022-01-11 01:08:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:08:05,000 INFO L225 Difference]: With dead ends: 1584 [2022-01-11 01:08:05,001 INFO L226 Difference]: Without dead ends: 792 [2022-01-11 01:08:05,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 01:08:05,009 INFO L933 BasicCegarLoop]: 791 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, 791 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-11 01:08:05,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:08:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-01-11 01:08:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2022-01-11 01:08:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.0) internal successors, (791), 791 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:08:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 791 transitions. [2022-01-11 01:08:05,055 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 791 transitions. Word has length 791 [2022-01-11 01:08:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:08:05,055 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 791 transitions. [2022-01-11 01:08:05,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 395.5) internal successors, (791), 2 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:08:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 791 transitions. [2022-01-11 01:08:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2022-01-11 01:08:05,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:08:05,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:08:05,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:08:05,067 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:08:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:08:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1698737150, now seen corresponding path program 1 times [2022-01-11 01:08:05,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:08:05,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300903931] [2022-01-11 01:08:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:08:05,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:08:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:08:06,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 01:08:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:08:08,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 01:08:08,668 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 01:08:08,671 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 01:08:08,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:08:08,678 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-11 01:08:08,682 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 01:08:10,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:08:10 BasicIcfg [2022-01-11 01:08:10,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 01:08:10,959 INFO L158 Benchmark]: Toolchain (without parser) took 8802.81ms. Allocated memory was 203.4MB in the beginning and 878.7MB in the end (delta: 675.3MB). Free memory was 145.1MB in the beginning and 363.1MB in the end (delta: -218.0MB). Peak memory consumption was 528.5MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,960 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 01:08:10,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.81ms. Allocated memory was 203.4MB in the beginning and 276.8MB in the end (delta: 73.4MB). Free memory was 145.0MB in the beginning and 229.0MB in the end (delta: -84.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.08ms. Allocated memory is still 276.8MB. Free memory was 229.0MB in the beginning and 216.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,961 INFO L158 Benchmark]: Boogie Preprocessor took 87.59ms. Allocated memory is still 276.8MB. Free memory was 216.5MB in the beginning and 206.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,961 INFO L158 Benchmark]: RCFGBuilder took 1231.78ms. Allocated memory is still 276.8MB. Free memory was 206.5MB in the beginning and 126.8MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,962 INFO L158 Benchmark]: IcfgTransformer took 364.01ms. Allocated memory is still 276.8MB. Free memory was 126.8MB in the beginning and 228.3MB in the end (delta: -101.4MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,962 INFO L158 Benchmark]: TraceAbstraction took 6593.81ms. Allocated memory was 276.8MB in the beginning and 878.7MB in the end (delta: 601.9MB). Free memory was 227.7MB in the beginning and 363.1MB in the end (delta: -135.4MB). Peak memory consumption was 536.8MB. Max. memory is 8.0GB. [2022-01-11 01:08:10,964 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 203.4MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 390.81ms. Allocated memory was 203.4MB in the beginning and 276.8MB in the end (delta: 73.4MB). Free memory was 145.0MB in the beginning and 229.0MB in the end (delta: -84.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 112.08ms. Allocated memory is still 276.8MB. Free memory was 229.0MB in the beginning and 216.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.59ms. Allocated memory is still 276.8MB. Free memory was 216.5MB in the beginning and 206.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1231.78ms. Allocated memory is still 276.8MB. Free memory was 206.5MB in the beginning and 126.8MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * IcfgTransformer took 364.01ms. Allocated memory is still 276.8MB. Free memory was 126.8MB in the beginning and 228.3MB in the end (delta: -101.4MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6593.81ms. Allocated memory was 276.8MB in the beginning and 878.7MB in the end (delta: 601.9MB). Free memory was 227.7MB in the beginning and 363.1MB in the end (delta: -135.4MB). Peak memory consumption was 536.8MB. 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: 626]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of BvToInt. Possible FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) [L30] CALL assume(var0 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 1) [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) [L34] CALL assume(var1 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 1) [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) [L38] CALL assume(var2 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 1) [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) [L42] CALL assume(var3 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 1) [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) [L46] CALL assume(var4 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 1) [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) [L50] CALL assume(var5 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 1) [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) [L54] CALL assume(var6 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 1) [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 0) [L58] CALL assume(var7 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 1) [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 0) [L62] CALL assume(var8 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 1) [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 0) [L66] CALL assume(var9 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 1) [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 0) [L70] CALL assume(var10 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 1) [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var11 >= 0) [L74] CALL assume(var11 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 1) [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var12 >= 0) [L78] CALL assume(var12 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 1) [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var13 >= 0) [L82] CALL assume(var13 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 1) [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var14 >= 0) [L86] CALL assume(var14 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 1) [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var15 >= 0) [L90] CALL assume(var15 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var15 <= 1) [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var16 >= 0) [L94] CALL assume(var16 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var16 <= 1) [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var17 >= 0) [L98] CALL assume(var17 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var17 <= 1) [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var18 >= 0) [L102] CALL assume(var18 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var18 <= 1) [L103] int var19; [L104] var19 = __VERIFIER_nondet_int() [L105] CALL assume(var19 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var19 >= 0) [L106] CALL assume(var19 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var19 <= 1) [L107] int var20; [L108] var20 = __VERIFIER_nondet_int() [L109] CALL assume(var20 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var20 >= 0) [L110] CALL assume(var20 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var20 <= 1) [L111] int var21; [L112] var21 = __VERIFIER_nondet_int() [L113] CALL assume(var21 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var21 >= 0) [L114] CALL assume(var21 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var21 <= 1) [L115] int var22; [L116] var22 = __VERIFIER_nondet_int() [L117] CALL assume(var22 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var22 >= 0) [L118] CALL assume(var22 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var22 <= 1) [L119] int var23; [L120] var23 = __VERIFIER_nondet_int() [L121] CALL assume(var23 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var23 >= 0) [L122] CALL assume(var23 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var23 <= 1) [L123] int var24; [L124] var24 = __VERIFIER_nondet_int() [L125] CALL assume(var24 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var24 >= 0) [L126] CALL assume(var24 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var24 <= 1) [L127] int var25; [L128] var25 = __VERIFIER_nondet_int() [L129] CALL assume(var25 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var25 >= 0) [L130] CALL assume(var25 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var25 <= 1) [L131] int var26; [L132] var26 = __VERIFIER_nondet_int() [L133] CALL assume(var26 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var26 >= 0) [L134] CALL assume(var26 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var26 <= 1) [L135] int var27; [L136] var27 = __VERIFIER_nondet_int() [L137] CALL assume(var27 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L137] RET assume(var27 >= 0) [L138] CALL assume(var27 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L138] RET assume(var27 <= 1) [L139] int var28; [L140] var28 = __VERIFIER_nondet_int() [L141] CALL assume(var28 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L141] RET assume(var28 >= 0) [L142] CALL assume(var28 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L142] RET assume(var28 <= 1) [L143] int var29; [L144] var29 = __VERIFIER_nondet_int() [L145] CALL assume(var29 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L145] RET assume(var29 >= 0) [L146] CALL assume(var29 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var29 <= 1) [L147] int var30; [L148] var30 = __VERIFIER_nondet_int() [L149] CALL assume(var30 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var30 >= 0) [L150] CALL assume(var30 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L150] RET assume(var30 <= 1) [L151] int var31; [L152] var31 = __VERIFIER_nondet_int() [L153] CALL assume(var31 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L153] RET assume(var31 >= 0) [L154] CALL assume(var31 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L154] RET assume(var31 <= 1) [L155] int var32; [L156] var32 = __VERIFIER_nondet_int() [L157] CALL assume(var32 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L157] RET assume(var32 >= 0) [L158] CALL assume(var32 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var32 <= 1) [L159] int var33; [L160] var33 = __VERIFIER_nondet_int() [L161] CALL assume(var33 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L161] RET assume(var33 >= 0) [L162] CALL assume(var33 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L162] RET assume(var33 <= 1) [L163] int var34; [L164] var34 = __VERIFIER_nondet_int() [L165] CALL assume(var34 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L165] RET assume(var34 >= 0) [L166] CALL assume(var34 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L166] RET assume(var34 <= 1) [L167] int var35; [L168] var35 = __VERIFIER_nondet_int() [L169] CALL assume(var35 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L169] RET assume(var35 >= 0) [L170] CALL assume(var35 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L170] RET assume(var35 <= 1) [L171] int var36; [L172] var36 = __VERIFIER_nondet_int() [L173] CALL assume(var36 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L173] RET assume(var36 >= 0) [L174] CALL assume(var36 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L174] RET assume(var36 <= 1) [L175] int var37; [L176] var37 = __VERIFIER_nondet_int() [L177] CALL assume(var37 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L177] RET assume(var37 >= 0) [L178] CALL assume(var37 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L178] RET assume(var37 <= 1) [L179] int var38; [L180] var38 = __VERIFIER_nondet_int() [L181] CALL assume(var38 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L181] RET assume(var38 >= 0) [L182] CALL assume(var38 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L182] RET assume(var38 <= 1) [L183] int var39; [L184] var39 = __VERIFIER_nondet_int() [L185] CALL assume(var39 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L185] RET assume(var39 >= 0) [L186] CALL assume(var39 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L186] RET assume(var39 <= 1) [L187] int var40; [L188] var40 = __VERIFIER_nondet_int() [L189] CALL assume(var40 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L189] RET assume(var40 >= 0) [L190] CALL assume(var40 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L190] RET assume(var40 <= 1) [L191] int var41; [L192] var41 = __VERIFIER_nondet_int() [L193] CALL assume(var41 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L193] RET assume(var41 >= 0) [L194] CALL assume(var41 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L194] RET assume(var41 <= 1) [L195] int var42; [L196] var42 = __VERIFIER_nondet_int() [L197] CALL assume(var42 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L197] RET assume(var42 >= 0) [L198] CALL assume(var42 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L198] RET assume(var42 <= 1) [L199] int var43; [L200] var43 = __VERIFIER_nondet_int() [L201] CALL assume(var43 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L201] RET assume(var43 >= 0) [L202] CALL assume(var43 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L202] RET assume(var43 <= 1) [L203] int var44; [L204] var44 = __VERIFIER_nondet_int() [L205] CALL assume(var44 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L205] RET assume(var44 >= 0) [L206] CALL assume(var44 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L206] RET assume(var44 <= 1) [L207] int var45; [L208] var45 = __VERIFIER_nondet_int() [L209] CALL assume(var45 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L209] RET assume(var45 >= 0) [L210] CALL assume(var45 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L210] RET assume(var45 <= 1) [L211] int var46; [L212] var46 = __VERIFIER_nondet_int() [L213] CALL assume(var46 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L213] RET assume(var46 >= 0) [L214] CALL assume(var46 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L214] RET assume(var46 <= 1) [L215] int var47; [L216] var47 = __VERIFIER_nondet_int() [L217] CALL assume(var47 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L217] RET assume(var47 >= 0) [L218] CALL assume(var47 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L218] RET assume(var47 <= 1) [L219] int var48; [L220] var48 = __VERIFIER_nondet_int() [L221] CALL assume(var48 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L221] RET assume(var48 >= 0) [L222] CALL assume(var48 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L222] RET assume(var48 <= 1) [L223] int var49; [L224] var49 = __VERIFIER_nondet_int() [L225] CALL assume(var49 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L225] RET assume(var49 >= 0) [L226] CALL assume(var49 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L226] RET assume(var49 <= 1) [L227] int var50; [L228] var50 = __VERIFIER_nondet_int() [L229] CALL assume(var50 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L229] RET assume(var50 >= 0) [L230] CALL assume(var50 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L230] RET assume(var50 <= 1) [L231] int var51; [L232] var51 = __VERIFIER_nondet_int() [L233] CALL assume(var51 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L233] RET assume(var51 >= 0) [L234] CALL assume(var51 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L234] RET assume(var51 <= 1) [L235] int var52; [L236] var52 = __VERIFIER_nondet_int() [L237] CALL assume(var52 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L237] RET assume(var52 >= 0) [L238] CALL assume(var52 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L238] RET assume(var52 <= 1) [L239] int var53; [L240] var53 = __VERIFIER_nondet_int() [L241] CALL assume(var53 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L241] RET assume(var53 >= 0) [L242] CALL assume(var53 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L242] RET assume(var53 <= 1) [L243] int var54; [L244] var54 = __VERIFIER_nondet_int() [L245] CALL assume(var54 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L245] RET assume(var54 >= 0) [L246] CALL assume(var54 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L246] RET assume(var54 <= 1) [L247] int var55; [L248] var55 = __VERIFIER_nondet_int() [L249] CALL assume(var55 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L249] RET assume(var55 >= 0) [L250] CALL assume(var55 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L250] RET assume(var55 <= 1) [L251] int var56; [L252] var56 = __VERIFIER_nondet_int() [L253] CALL assume(var56 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L253] RET assume(var56 >= 0) [L254] CALL assume(var56 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L254] RET assume(var56 <= 1) [L255] int var57; [L256] var57 = __VERIFIER_nondet_int() [L257] CALL assume(var57 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L257] RET assume(var57 >= 0) [L258] CALL assume(var57 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L258] RET assume(var57 <= 1) [L259] int var58; [L260] var58 = __VERIFIER_nondet_int() [L261] CALL assume(var58 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L261] RET assume(var58 >= 0) [L262] CALL assume(var58 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L262] RET assume(var58 <= 1) [L263] int var59; [L264] var59 = __VERIFIER_nondet_int() [L265] CALL assume(var59 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L265] RET assume(var59 >= 0) [L266] CALL assume(var59 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L266] RET assume(var59 <= 1) [L267] int var60; [L268] var60 = __VERIFIER_nondet_int() [L269] CALL assume(var60 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L269] RET assume(var60 >= 0) [L270] CALL assume(var60 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L270] RET assume(var60 <= 1) [L271] int var61; [L272] var61 = __VERIFIER_nondet_int() [L273] CALL assume(var61 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L273] RET assume(var61 >= 0) [L274] CALL assume(var61 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L274] RET assume(var61 <= 1) [L275] int var62; [L276] var62 = __VERIFIER_nondet_int() [L277] CALL assume(var62 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L277] RET assume(var62 >= 0) [L278] CALL assume(var62 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L278] RET assume(var62 <= 1) [L279] int var63; [L280] var63 = __VERIFIER_nondet_int() [L281] CALL assume(var63 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L281] RET assume(var63 >= 0) [L282] CALL assume(var63 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L282] RET assume(var63 <= 1) [L283] int var64; [L284] var64 = __VERIFIER_nondet_int() [L285] CALL assume(var64 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L285] RET assume(var64 >= 0) [L286] CALL assume(var64 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L286] RET assume(var64 <= 1) [L287] int var65; [L288] var65 = __VERIFIER_nondet_int() [L289] CALL assume(var65 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L289] RET assume(var65 >= 0) [L290] CALL assume(var65 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L290] RET assume(var65 <= 1) [L291] int var66; [L292] var66 = __VERIFIER_nondet_int() [L293] CALL assume(var66 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L293] RET assume(var66 >= 0) [L294] CALL assume(var66 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L294] RET assume(var66 <= 1) [L295] int var67; [L296] var67 = __VERIFIER_nondet_int() [L297] CALL assume(var67 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L297] RET assume(var67 >= 0) [L298] CALL assume(var67 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L298] RET assume(var67 <= 1) [L299] int var68; [L300] var68 = __VERIFIER_nondet_int() [L301] CALL assume(var68 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L301] RET assume(var68 >= 0) [L302] CALL assume(var68 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L302] RET assume(var68 <= 1) [L303] int var69; [L304] var69 = __VERIFIER_nondet_int() [L305] CALL assume(var69 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L305] RET assume(var69 >= 0) [L306] CALL assume(var69 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L306] RET assume(var69 <= 1) [L307] int var70; [L308] var70 = __VERIFIER_nondet_int() [L309] CALL assume(var70 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L309] RET assume(var70 >= 0) [L310] CALL assume(var70 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L310] RET assume(var70 <= 1) [L311] int var71; [L312] var71 = __VERIFIER_nondet_int() [L313] CALL assume(var71 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L313] RET assume(var71 >= 0) [L314] CALL assume(var71 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L314] RET assume(var71 <= 1) [L315] int var72; [L316] var72 = __VERIFIER_nondet_int() [L317] CALL assume(var72 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L317] RET assume(var72 >= 0) [L318] CALL assume(var72 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L318] RET assume(var72 <= 1) [L319] int var73; [L320] var73 = __VERIFIER_nondet_int() [L321] CALL assume(var73 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L321] RET assume(var73 >= 0) [L322] CALL assume(var73 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L322] RET assume(var73 <= 1) [L323] int var74; [L324] var74 = __VERIFIER_nondet_int() [L325] CALL assume(var74 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L325] RET assume(var74 >= 0) [L326] CALL assume(var74 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L326] RET assume(var74 <= 1) [L327] int var75; [L328] var75 = __VERIFIER_nondet_int() [L329] CALL assume(var75 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L329] RET assume(var75 >= 0) [L330] CALL assume(var75 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L330] RET assume(var75 <= 1) [L331] int var76; [L332] var76 = __VERIFIER_nondet_int() [L333] CALL assume(var76 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L333] RET assume(var76 >= 0) [L334] CALL assume(var76 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L334] RET assume(var76 <= 1) [L335] int var77; [L336] var77 = __VERIFIER_nondet_int() [L337] CALL assume(var77 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L337] RET assume(var77 >= 0) [L338] CALL assume(var77 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L338] RET assume(var77 <= 1) [L339] int var78; [L340] var78 = __VERIFIER_nondet_int() [L341] CALL assume(var78 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L341] RET assume(var78 >= 0) [L342] CALL assume(var78 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L342] RET assume(var78 <= 1) [L343] int var79; [L344] var79 = __VERIFIER_nondet_int() [L345] CALL assume(var79 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L345] RET assume(var79 >= 0) [L346] CALL assume(var79 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L346] RET assume(var79 <= 1) [L347] int var80; [L348] var80 = __VERIFIER_nondet_int() [L349] CALL assume(var80 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L349] RET assume(var80 >= 0) [L350] CALL assume(var80 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L350] RET assume(var80 <= 1) [L351] int var81; [L352] var81 = __VERIFIER_nondet_int() [L353] CALL assume(var81 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L353] RET assume(var81 >= 0) [L354] CALL assume(var81 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L354] RET assume(var81 <= 1) [L355] int var82; [L356] var82 = __VERIFIER_nondet_int() [L357] CALL assume(var82 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L357] RET assume(var82 >= 0) [L358] CALL assume(var82 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L358] RET assume(var82 <= 1) [L359] int var83; [L360] var83 = __VERIFIER_nondet_int() [L361] CALL assume(var83 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L361] RET assume(var83 >= 0) [L362] CALL assume(var83 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L362] RET assume(var83 <= 1) [L363] int var84; [L364] var84 = __VERIFIER_nondet_int() [L365] CALL assume(var84 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L365] RET assume(var84 >= 0) [L366] CALL assume(var84 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L366] RET assume(var84 <= 1) [L367] int var85; [L368] var85 = __VERIFIER_nondet_int() [L369] CALL assume(var85 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L369] RET assume(var85 >= 0) [L370] CALL assume(var85 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L370] RET assume(var85 <= 1) [L371] int var86; [L372] var86 = __VERIFIER_nondet_int() [L373] CALL assume(var86 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L373] RET assume(var86 >= 0) [L374] CALL assume(var86 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L374] RET assume(var86 <= 1) [L375] int var87; [L376] var87 = __VERIFIER_nondet_int() [L377] CALL assume(var87 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L377] RET assume(var87 >= 0) [L378] CALL assume(var87 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L378] RET assume(var87 <= 1) [L379] int var88; [L380] var88 = __VERIFIER_nondet_int() [L381] CALL assume(var88 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L381] RET assume(var88 >= 0) [L382] CALL assume(var88 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L382] RET assume(var88 <= 1) [L383] int var89; [L384] var89 = __VERIFIER_nondet_int() [L385] CALL assume(var89 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L385] RET assume(var89 >= 0) [L386] CALL assume(var89 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L386] RET assume(var89 <= 1) [L387] int var90; [L388] var90 = __VERIFIER_nondet_int() [L389] CALL assume(var90 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L389] RET assume(var90 >= 0) [L390] CALL assume(var90 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L390] RET assume(var90 <= 1) [L391] int var91; [L392] var91 = __VERIFIER_nondet_int() [L393] CALL assume(var91 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L393] RET assume(var91 >= 0) [L394] CALL assume(var91 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L394] RET assume(var91 <= 1) [L395] int var92; [L396] var92 = __VERIFIER_nondet_int() [L397] CALL assume(var92 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L397] RET assume(var92 >= 0) [L398] CALL assume(var92 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L398] RET assume(var92 <= 1) [L399] int var93; [L400] var93 = __VERIFIER_nondet_int() [L401] CALL assume(var93 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L401] RET assume(var93 >= 0) [L402] CALL assume(var93 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L402] RET assume(var93 <= 1) [L403] int var94; [L404] var94 = __VERIFIER_nondet_int() [L405] CALL assume(var94 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L405] RET assume(var94 >= 0) [L406] CALL assume(var94 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L406] RET assume(var94 <= 1) [L407] int var95; [L408] var95 = __VERIFIER_nondet_int() [L409] CALL assume(var95 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L409] RET assume(var95 >= 0) [L410] CALL assume(var95 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L410] RET assume(var95 <= 1) [L411] int var96; [L412] var96 = __VERIFIER_nondet_int() [L413] CALL assume(var96 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L413] RET assume(var96 >= 0) [L414] CALL assume(var96 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L414] RET assume(var96 <= 1) [L415] int var97; [L416] var97 = __VERIFIER_nondet_int() [L417] CALL assume(var97 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L417] RET assume(var97 >= 0) [L418] CALL assume(var97 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L418] RET assume(var97 <= 1) [L419] int var98; [L420] var98 = __VERIFIER_nondet_int() [L421] CALL assume(var98 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L421] RET assume(var98 >= 0) [L422] CALL assume(var98 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L422] RET assume(var98 <= 1) [L423] int var99; [L424] var99 = __VERIFIER_nondet_int() [L425] CALL assume(var99 >= 0) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L425] RET assume(var99 >= 0) [L426] CALL assume(var99 <= 1) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L426] RET assume(var99 <= 1) [L427] int myvar0 = 1; [L428-L429] CALL assume(!((var0 == 0 & var9 == 0 & var46 == 0) | (var0 == 0 & var9 == 1 & var46 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L428-L429] RET assume(!((var0 == 0 & var9 == 0 & var46 == 0) | (var0 == 0 & var9 == 1 & var46 == 0) | 0)) [L430-L431] CALL assume(!((var26 == 0 & var90 == 0 & var99 == 0) | (var26 == 0 & var90 == 1 & var99 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L430-L431] RET assume(!((var26 == 0 & var90 == 0 & var99 == 0) | (var26 == 0 & var90 == 1 & var99 == 0) | 0)) [L432] CALL assume(!((var19 == 0 & var78 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L432] RET assume(!((var19 == 0 & var78 == 0) | 0)) [L433] CALL assume(!((var33 == 0 & var41 == 1 & var87 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L433] RET assume(!((var33 == 0 & var41 == 1 & var87 == 0) | 0)) [L434] CALL assume(!((var22 == 0 & var33 == 1 & var37 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L434] RET assume(!((var22 == 0 & var33 == 1 & var37 == 0) | 0)) [L435] CALL assume(!((var3 == 0 & var30 == 1 & var79 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L435] RET assume(!((var3 == 0 & var30 == 1 & var79 == 0) | 0)) [L436] CALL assume(!((var12 == 0 & var26 == 1 & var96 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L436] RET assume(!((var12 == 0 & var26 == 1 & var96 == 0) | 0)) [L437] CALL assume(!((var12 == 0 & var49 == 1 & var67 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L437] RET assume(!((var12 == 0 & var49 == 1 & var67 == 0) | 0)) [L438] CALL assume(!((var16 == 0 & var35 == 1 & var54 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L438] RET assume(!((var16 == 0 & var35 == 1 & var54 == 0) | 0)) [L439] CALL assume(!((var49 == 0 & var53 == 1 & var83 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L439] RET assume(!((var49 == 0 & var53 == 1 & var83 == 0) | 0)) [L440] CALL assume(!((var53 == 0 & var77 == 1 & var94 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L440] RET assume(!((var53 == 0 & var77 == 1 & var94 == 0) | 0)) [L441] CALL assume(!((var13 == 0 & var14 == 1 & var95 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L441] RET assume(!((var13 == 0 & var14 == 1 & var95 == 0) | 0)) [L442] CALL assume(!((var7 == 0 & var39 == 1 & var40 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L442] RET assume(!((var7 == 0 & var39 == 1 & var40 == 0) | 0)) [L443] CALL assume(!((var31 == 0 & var81 == 1 & var94 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L443] RET assume(!((var31 == 0 & var81 == 1 & var94 == 0) | 0)) [L444] CALL assume(!((var31 == 0 & var36 == 1 & var55 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L444] RET assume(!((var31 == 0 & var36 == 1 & var55 == 0) | 0)) [L445] CALL assume(!((var2 == 0 & var75 == 1 & var82 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L445] RET assume(!((var2 == 0 & var75 == 1 & var82 == 0) | 0)) [L446] CALL assume(!((var20 == 0 & var69 == 1 & var71 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L446] RET assume(!((var20 == 0 & var69 == 1 & var71 == 0) | 0)) [L447] CALL assume(!((var11 == 0 & var16 == 1 & var28 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L447] RET assume(!((var11 == 0 & var16 == 1 & var28 == 0) | 0)) [L448] CALL assume(!((var1 == 0 & var8 == 1 & var42 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L448] RET assume(!((var1 == 0 & var8 == 1 & var42 == 0) | 0)) [L449] CALL assume(!((var6 == 0 & var51 == 1 & var78 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L449] RET assume(!((var6 == 0 & var51 == 1 & var78 == 0) | 0)) [L450] CALL assume(!((var4 == 0 & var57 == 1 & var85 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L450] RET assume(!((var4 == 0 & var57 == 1 & var85 == 0) | 0)) [L451] CALL assume(!((var33 == 0 & var41 == 1 & var65 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L451] RET assume(!((var33 == 0 & var41 == 1 & var65 == 0) | 0)) [L452] CALL assume(!((var28 == 1 & var41 == 0 & var96 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L452] RET assume(!((var28 == 1 & var41 == 0 & var96 == 0) | 0)) [L453] CALL assume(!((var42 == 1 & var45 == 0 & var50 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L453] RET assume(!((var42 == 1 & var45 == 0 & var50 == 0) | 0)) [L454] CALL assume(!((var50 == 1 & var70 == 0 & var92 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L454] RET assume(!((var50 == 1 & var70 == 0 & var92 == 0) | 0)) [L455] CALL assume(!((var13 == 1 & var65 == 0 & var68 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L455] RET assume(!((var13 == 1 & var65 == 0 & var68 == 0) | 0)) [L456] CALL assume(!((var68 == 1 & var90 == 0 & var99 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L456] RET assume(!((var68 == 1 & var90 == 0 & var99 == 0) | 0)) [L457] CALL assume(!((var11 == 1 & var48 == 0 & var69 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L457] RET assume(!((var11 == 1 & var48 == 0 & var69 == 0) | 0)) [L458] CALL assume(!((var35 == 1 & var50 == 0 & var54 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L458] RET assume(!((var35 == 1 & var50 == 0 & var54 == 0) | 0)) [L459] CALL assume(!((var8 == 1 & var21 == 0 & var35 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L459] RET assume(!((var8 == 1 & var21 == 0 & var35 == 0) | 0)) [L460] CALL assume(!((var18 == 1 & var45 == 0 & var75 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L460] RET assume(!((var18 == 1 & var45 == 0 & var75 == 0) | 0)) [L461] CALL assume(!((var34 == 1 & var52 == 0 & var83 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L461] RET assume(!((var34 == 1 & var52 == 0 & var83 == 0) | 0)) [L462] CALL assume(!((var13 == 1 & var77 == 0 & var95 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L462] RET assume(!((var13 == 1 & var77 == 0 & var95 == 0) | 0)) [L463] CALL assume(!((var14 == 1 & var40 == 0 & var56 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L463] RET assume(!((var14 == 1 & var40 == 0 & var56 == 0) | 0)) [L464] CALL assume(!((var14 == 1 & var39 == 0 & var40 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L464] RET assume(!((var14 == 1 & var39 == 0 & var40 == 0) | 0)) [L465] CALL assume(!((var73 == 1 & var86 == 0 & var93 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L465] RET assume(!((var73 == 1 & var86 == 0 & var93 == 0) | 0)) [L466] CALL assume(!((var60 == 1 & var75 == 0 & var82 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L466] RET assume(!((var60 == 1 & var75 == 0 & var82 == 0) | 0)) [L467] CALL assume(!((var22 == 1 & var58 == 0 & var84 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L467] RET assume(!((var22 == 1 & var58 == 0 & var84 == 0) | 0)) [L468] CALL assume(!((var43 == 1 & var84 == 0 & var88 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L468] RET assume(!((var43 == 1 & var84 == 0 & var88 == 0) | 0)) [L469] CALL assume(!((var5 == 1 & var17 == 0 & var27 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L469] RET assume(!((var5 == 1 & var17 == 0 & var27 == 0) | 0)) [L470] CALL assume(!((var44 == 1 & var45 == 0 & var57 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L470] RET assume(!((var44 == 1 & var45 == 0 & var57 == 0) | 0)) [L471] CALL assume(!((var25 == 1 & var53 == 0 & var74 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L471] RET assume(!((var25 == 1 & var53 == 0 & var74 == 0) | 0)) [L472] CALL assume(!((var27 == 1 & var30 == 0 & var97 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L472] RET assume(!((var27 == 1 & var30 == 0 & var97 == 0) | 0)) [L473] CALL assume(!((var25 == 1 & var29 == 0 & var51 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L473] RET assume(!((var25 == 1 & var29 == 0 & var51 == 0) | 0)) [L474] CALL assume(!((var17 == 1 & var56 == 0 & var64 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L474] RET assume(!((var17 == 1 & var56 == 0 & var64 == 0) | 0)) [L475] CALL assume(!((var17 == 1 & var47 == 0 & var48 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L475] RET assume(!((var17 == 1 & var47 == 0 & var48 == 0) | 0)) [L476] CALL assume(!((var35 == 1 & var61 == 0 & var85 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L476] RET assume(!((var35 == 1 & var61 == 0 & var85 == 0) | 0)) [L477] CALL assume(!((var8 == 1 & var23 == 0 & var57 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L477] RET assume(!((var8 == 1 & var23 == 0 & var57 == 0) | 0)) [L478] CALL assume(!((var61 == 1 & var66 == 0 & var77 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L478] RET assume(!((var61 == 1 & var66 == 0 & var77 == 0) | 0)) [L479] CALL assume(!((var11 == 0 & var13 == 0 & var99 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L479] RET assume(!((var11 == 0 & var13 == 0 & var99 == 1) | 0)) [L480] CALL assume(!((var11 == 0 & var13 == 0 & var96 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L480] RET assume(!((var11 == 0 & var13 == 0 & var96 == 1) | 0)) [L481] CALL assume(!((var49 == 0 & var72 == 0 & var98 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L481] RET assume(!((var49 == 0 & var72 == 0 & var98 == 1) | 0)) [L482] CALL assume(!((var38 == 0 & var49 == 0 & var72 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L482] RET assume(!((var38 == 0 & var49 == 0 & var72 == 1) | 0)) [L483] CALL assume(!((var16 == 0 & var35 == 0 & var83 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L483] RET assume(!((var16 == 0 & var35 == 0 & var83 == 1) | 0)) [L484] CALL assume(!((var15 == 0 & var16 == 0 & var21 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L484] RET assume(!((var15 == 0 & var16 == 0 & var21 == 1) | 0)) [L485] CALL assume(!((var18 == 0 & var27 == 0 & var64 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L485] RET assume(!((var18 == 0 & var27 == 0 & var64 == 1) | 0)) [L486] CALL assume(!((var0 == 0 & var46 == 0 & var90 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L486] RET assume(!((var0 == 0 & var46 == 0 & var90 == 1) | 0)) [L487] CALL assume(!((var5 == 0 & var34 == 0 & var46 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L487] RET assume(!((var5 == 0 & var34 == 0 & var46 == 1) | 0)) [L488] CALL assume(!((var81 == 0 & var92 == 0 & var93 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L488] RET assume(!((var81 == 0 & var92 == 0 & var93 == 1) | 0)) [L489] CALL assume(!((var36 == 0 & var59 == 0 & var94 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L489] RET assume(!((var36 == 0 & var59 == 0 & var94 == 1) | 0)) [L490] CALL assume(!((var9 == 0 & var47 == 0 & var80 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L490] RET assume(!((var9 == 0 & var47 == 0 & var80 == 1) | 0)) [L491] CALL assume(!((var52 == 0 & var58 == 0 & var84 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L491] RET assume(!((var52 == 0 & var58 == 0 & var84 == 1) | 0)) [L492] CALL assume(!((var63 == 0 & var71 == 0 & var84 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L492] RET assume(!((var63 == 0 & var71 == 0 & var84 == 1) | 0)) [L493] CALL assume(!((var5 == 0 & var17 == 0 & var71 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L493] RET assume(!((var5 == 0 & var17 == 0 & var71 == 1) | 0)) [L494] CALL assume(!((var24 == 0 & var55 == 0 & var86 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L494] RET assume(!((var24 == 0 & var55 == 0 & var86 == 1) | 0)) [L495] CALL assume(!((var3 == 0 & var72 == 0 & var86 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L495] RET assume(!((var3 == 0 & var72 == 0 & var86 == 1) | 0)) [L496] CALL assume(!((var2 == 0 & var34 == 0 & var78 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L496] RET assume(!((var2 == 0 & var34 == 0 & var78 == 1) | 0)) [L497] CALL assume(!((var56 == 0 & var62 == 0 & var65 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L497] RET assume(!((var56 == 0 & var62 == 0 & var65 == 1) | 0)) [L498-L499] CALL assume(!((var1 == 0 & var22 == 0 & var79 == 1) | (var1 == 0 & var22 == 1 & var79 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L498-L499] RET assume(!((var1 == 0 & var22 == 0 & var79 == 1) | (var1 == 0 & var22 == 1 & var79 == 1) | 0)) [L500-L501] CALL assume(!((var8 == 0 & var18 == 0 & var27 == 0) | (var8 == 0 & var18 == 0 & var27 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L500-L501] RET assume(!((var8 == 0 & var18 == 0 & var27 == 0) | (var8 == 0 & var18 == 0 & var27 == 1) | 0)) [L502] CALL assume(!((var28 == 0 & var66 == 1 & var92 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L502] RET assume(!((var28 == 0 & var66 == 1 & var92 == 1) | 0)) [L503] CALL assume(!((var33 == 0 & var65 == 1 & var87 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L503] RET assume(!((var33 == 0 & var65 == 1 & var87 == 1) | 0)) [L504] CALL assume(!((var19 == 0 & var33 == 1 & var37 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L504] RET assume(!((var19 == 0 & var33 == 1 & var37 == 1) | 0)) [L505] CALL assume(!((var10 == 0 & var62 == 1 & var70 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L505] RET assume(!((var10 == 0 & var62 == 1 & var70 == 1) | 0)) [L506] CALL assume(!((var9 == 0 & var11 == 1 & var69 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L506] RET assume(!((var9 == 0 & var11 == 1 & var69 == 1) | 0)) [L507] CALL assume(!((var38 == 0 & var61 == 1 & var98 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L507] RET assume(!((var38 == 0 & var61 == 1 & var98 == 1) | 0)) [L508] CALL assume(!((var12 == 0 & var36 == 1 & var67 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L508] RET assume(!((var12 == 0 & var36 == 1 & var67 == 1) | 0)) [L509] CALL assume(!((var52 == 0 & var53 == 1 & var83 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L509] RET assume(!((var52 == 0 & var53 == 1 & var83 == 1) | 0)) [L510] CALL assume(!((var81 == 0 & var83 == 1 & var92 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L510] RET assume(!((var81 == 0 & var83 == 1 & var92 == 1) | 0)) [L511] CALL assume(!((var24 == 0 & var31 == 1 & var85 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L511] RET assume(!((var24 == 0 & var31 == 1 & var85 == 1) | 0)) [L512] CALL assume(!((var24 == 0 & var75 == 1 & var85 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L512] RET assume(!((var24 == 0 & var75 == 1 & var85 == 1) | 0)) [L513] CALL assume(!((var6 == 0 & var47 == 1 & var91 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L513] RET assume(!((var6 == 0 & var47 == 1 & var91 == 1) | 0)) [L514] CALL assume(!((var23 == 0 & var87 == 1 & var89 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L514] RET assume(!((var23 == 0 & var87 == 1 & var89 == 1) | 0)) [L515] CALL assume(!((var32 == 0 & var43 == 1 & var88 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L515] RET assume(!((var32 == 0 & var43 == 1 & var88 == 1) | 0)) [L516] CALL assume(!((var23 == 0 & var58 == 1 & var82 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L516] RET assume(!((var23 == 0 & var58 == 1 & var82 == 1) | 0)) [L517] CALL assume(!((var15 == 0 & var38 == 1 & var44 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L517] RET assume(!((var15 == 0 & var38 == 1 & var44 == 1) | 0)) [L518] CALL assume(!((var32 == 0 & var61 == 1 & var77 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L518] RET assume(!((var32 == 0 & var61 == 1 & var77 == 1) | 0)) [L519] CALL assume(!((var28 == 0 & var41 == 0 & var92 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L519] RET assume(!((var28 == 0 & var41 == 0 & var92 == 0) | 0)) [L520] CALL assume(!((var15 == 0 & var30 == 0 & var79 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L520] RET assume(!((var15 == 0 & var30 == 0 & var79 == 0) | 0)) [L521] CALL assume(!((var25 == 0 & var58 == 0 & var59 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L521] RET assume(!((var25 == 0 & var58 == 0 & var59 == 0) | 0)) [L522] CALL assume(!((var7 == 0 & var25 == 0 & var42 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L522] RET assume(!((var7 == 0 & var25 == 0 & var42 == 0) | 0)) [L523] CALL assume(!((var68 == 0 & var76 == 0 & var96 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L523] RET assume(!((var68 == 0 & var76 == 0 & var96 == 0) | 0)) [L524] CALL assume(!((var38 == 0 & var63 == 0 & var98 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L524] RET assume(!((var38 == 0 & var63 == 0 & var98 == 0) | 0)) [L525] CALL assume(!((var8 == 0 & var21 == 0 & var64 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L525] RET assume(!((var8 == 0 & var21 == 0 & var64 == 0) | 0)) [L526] CALL assume(!((var14 == 0 & var77 == 0 & var94 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L526] RET assume(!((var14 == 0 & var77 == 0 & var94 == 0) | 0)) [L527] CALL assume(!((var43 == 0 & var81 == 0 & var83 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L527] RET assume(!((var43 == 0 & var81 == 0 & var83 == 0) | 0)) [L528] CALL assume(!((var36 == 0 & var59 == 0 & var98 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L528] RET assume(!((var36 == 0 & var59 == 0 & var98 == 0) | 0)) [L529] CALL assume(!((var31 == 0 & var36 == 0 & var43 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L529] RET assume(!((var31 == 0 & var36 == 0 & var43 == 0) | 0)) [L530] CALL assume(!((var5 == 0 & var88 == 0 & var91 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L530] RET assume(!((var5 == 0 & var88 == 0 & var91 == 0) | 0)) [L531] CALL assume(!((var82 == 0 & var88 == 0 & var91 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L531] RET assume(!((var82 == 0 & var88 == 0 & var91 == 0) | 0)) [L532] CALL assume(!((var22 == 0 & var43 == 0 & var84 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L532] RET assume(!((var22 == 0 & var43 == 0 & var84 == 0) | 0)) [L533] CALL assume(!((var7 == 0 & var10 == 0 & var89 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L533] RET assume(!((var7 == 0 & var10 == 0 & var89 == 0) | 0)) [L534] CALL assume(!((var51 == 0 & var78 == 0 & var98 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L534] RET assume(!((var51 == 0 & var78 == 0 & var98 == 0) | 0)) [L535] CALL assume(!((var44 == 0 & var51 == 0 & var93 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L535] RET assume(!((var44 == 0 & var51 == 0 & var93 == 0) | 0)) [L536] CALL assume(!((var44 == 0 & var70 == 0 & var97 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L536] RET assume(!((var44 == 0 & var70 == 0 & var97 == 0) | 0)) [L537] CALL assume(!((var60 == 0 & var70 == 0 & var73 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L537] RET assume(!((var60 == 0 & var70 == 0 & var73 == 0) | 0)) [L538] CALL assume(!((var3 == 0 & var17 == 0 & var67 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L538] RET assume(!((var3 == 0 & var17 == 0 & var67 == 0) | 0)) [L539] CALL assume(!((var37 == 0 & var60 == 0 & var62 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L539] RET assume(!((var37 == 0 & var60 == 0 & var62 == 0) | 0)) [L540] CALL assume(!((var14 == 0 & var55 == 0 & var76 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L540] RET assume(!((var14 == 0 & var55 == 0 & var76 == 0) | 0)) [L541] CALL assume(!((var61 == 0 & var67 == 0 & var89 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L541] RET assume(!((var61 == 0 & var67 == 0 & var89 == 0) | 0)) [L542] CALL assume(!((var32 == 0 & var48 == 0 & var73 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L542] RET assume(!((var32 == 0 & var48 == 0 & var73 == 0) | 0)) [L543] CALL assume(!((var4 == 0 & var20 == 0 & var76 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L543] RET assume(!((var4 == 0 & var20 == 0 & var76 == 0) | 0)) [L544] CALL assume(!((var14 == 0 & var44 == 0 & var80 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L544] RET assume(!((var14 == 0 & var44 == 0 & var80 == 0) | 0)) [L545] CALL assume(!((var6 == 0 & var10 == 0 & var37 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L545] RET assume(!((var6 == 0 & var10 == 0 & var37 == 0) | 0)) [L546] CALL assume(!((var4 == 0 & var29 == 0 & var90 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L546] RET assume(!((var4 == 0 & var29 == 0 & var90 == 0) | 0)) [L547] CALL assume(!((var41 == 0 & var61 == 0 & var66 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L547] RET assume(!((var41 == 0 & var61 == 0 & var66 == 0) | 0)) [L548] CALL assume(!((var19 == 1 & var20 == 0 & var37 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L548] RET assume(!((var19 == 1 & var20 == 0 & var37 == 1) | 0)) [L549] CALL assume(!((var15 == 1 & var30 == 0 & var97 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L549] RET assume(!((var15 == 1 & var30 == 0 & var97 == 1) | 0)) [L550] CALL assume(!((var3 == 1 & var25 == 0 & var58 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L550] RET assume(!((var3 == 1 & var25 == 0 & var58 == 1) | 0)) [L551] CALL assume(!((var7 == 1 & var42 == 0 & var59 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L551] RET assume(!((var7 == 1 & var42 == 0 & var59 == 1) | 0)) [L552] CALL assume(!((var45 == 1 & var50 == 0 & var59 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L552] RET assume(!((var45 == 1 & var50 == 0 & var59 == 1) | 0)) [L553] CALL assume(!((var50 == 1 & var65 == 0 & var70 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L553] RET assume(!((var50 == 1 & var65 == 0 & var70 == 1) | 0)) [L554] CALL assume(!((var56 == 1 & var62 == 0 & var70 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L554] RET assume(!((var56 == 1 & var62 == 0 & var70 == 1) | 0)) [L555] CALL assume(!((var13 == 1 & var26 == 0 & var76 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L555] RET assume(!((var13 == 1 & var26 == 0 & var76 == 1) | 0)) [L556] CALL assume(!((var26 == 1 & var68 == 0 & var76 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L556] RET assume(!((var26 == 1 & var68 == 0 & var76 == 1) | 0)) [L557] CALL assume(!((var16 == 1 & var54 == 0 & var67 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L557] RET assume(!((var16 == 1 & var54 == 0 & var67 == 1) | 0)) [L558] CALL assume(!((var0 == 1 & var21 == 0 & var45 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L558] RET assume(!((var0 == 1 & var21 == 0 & var45 == 1) | 0)) [L559] CALL assume(!((var5 == 1 & var34 == 0 & var45 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L559] RET assume(!((var5 == 1 & var34 == 0 & var45 == 1) | 0)) [L560] CALL assume(!((var34 == 1 & var53 == 0 & var94 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L560] RET assume(!((var34 == 1 & var53 == 0 & var94 == 1) | 0)) [L561] CALL assume(!((var40 == 1 & var73 == 0 & var95 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L561] RET assume(!((var40 == 1 & var73 == 0 & var95 == 1) | 0)) [L562] CALL assume(!((var43 == 1 & var86 == 0 & var93 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L562] RET assume(!((var43 == 1 & var86 == 0 & var93 == 1) | 0)) [L563] CALL assume(!((var24 == 1 & var80 == 0 & var85 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L563] RET assume(!((var24 == 1 & var80 == 0 & var85 == 1) | 0)) [L564] CALL assume(!((var9 == 1 & var47 == 0 & var91 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L564] RET assume(!((var9 == 1 & var47 == 0 & var91 == 1) | 0)) [L565] CALL assume(!((var23 == 1 & var74 == 0 & var89 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L565] RET assume(!((var23 == 1 & var74 == 0 & var89 == 1) | 0)) [L566] CALL assume(!((var23 == 1 & var29 == 0 & var74 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L566] RET assume(!((var23 == 1 & var29 == 0 & var74 == 1) | 0)) [L567] CALL assume(!((var27 == 1 & var64 == 0 & var78 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L567] RET assume(!((var27 == 1 & var64 == 0 & var78 == 1) | 0)) [L568] CALL assume(!((var32 == 1 & var66 == 0 & var77 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L568] RET assume(!((var32 == 1 & var66 == 0 & var77 == 1) | 0)) [L569] CALL assume(!((var22 == 1 & var33 == 1 & var41 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L569] RET assume(!((var22 == 1 & var33 == 1 & var41 == 1) | 0)) [L570] CALL assume(!((var19 == 1 & var37 == 1 & var56 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L570] RET assume(!((var19 == 1 & var37 == 1 & var56 == 1) | 0)) [L571] CALL assume(!((var20 == 1 & var44 == 1 & var97 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L571] RET assume(!((var20 == 1 & var44 == 1 & var97 == 1) | 0)) [L572] CALL assume(!((var1 == 1 & var79 == 1 & var97 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L572] RET assume(!((var1 == 1 & var79 == 1 & var97 == 1) | 0)) [L573] CALL assume(!((var3 == 1 & var30 == 1 & var66 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L573] RET assume(!((var3 == 1 & var30 == 1 & var66 == 1) | 0)) [L574] CALL assume(!((var3 == 1 & var25 == 1 & var30 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L574] RET assume(!((var3 == 1 & var25 == 1 & var30 == 1) | 0)) [L575] CALL assume(!((var42 == 1 & var59 == 1 & var90 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L575] RET assume(!((var42 == 1 & var59 == 1 & var90 == 1) | 0)) [L576] CALL assume(!((var42 == 1 & var50 == 1 & var92 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L576] RET assume(!((var42 == 1 & var50 == 1 & var92 == 1) | 0)) [L577] CALL assume(!((var62 == 1 & var65 == 1 & var96 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L577] RET assume(!((var62 == 1 & var65 == 1 & var96 == 1) | 0)) [L578] CALL assume(!((var10 == 1 & var62 == 1 & var68 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L578] RET assume(!((var10 == 1 & var62 == 1 & var68 == 1) | 0)) [L579] CALL assume(!((var10 == 1 & var12 == 1 & var26 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L579] RET assume(!((var10 == 1 & var12 == 1 & var26 == 1) | 0)) [L580] CALL assume(!((var4 == 1 & var76 == 1 & var99 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L580] RET assume(!((var4 == 1 & var76 == 1 & var99 == 1) | 0)) [L581] CALL assume(!((var9 == 1 & var11 == 1 & var99 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L581] RET assume(!((var9 == 1 & var11 == 1 & var99 == 1) | 0)) [L582] CALL assume(!((var12 == 1 & var49 == 1 & var98 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L582] RET assume(!((var12 == 1 & var49 == 1 & var98 == 1) | 0)) [L583] CALL assume(!((var49 == 1 & var54 == 1 & var67 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L583] RET assume(!((var49 == 1 & var54 == 1 & var67 == 1) | 0)) [L584] CALL assume(!((var2 == 1 & var18 == 1 & var64 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L584] RET assume(!((var2 == 1 & var18 == 1 & var64 == 1) | 0)) [L585] CALL assume(!((var18 == 1 & var64 == 1 & var75 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L585] RET assume(!((var18 == 1 & var64 == 1 & var75 == 1) | 0)) [L586] CALL assume(!((var34 == 1 & var46 == 1 & var78 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L586] RET assume(!((var34 == 1 & var46 == 1 & var78 == 1) | 0)) [L587] CALL assume(!((var46 == 1 & var52 == 1 & var53 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L587] RET assume(!((var46 == 1 & var52 == 1 & var53 == 1) | 0)) [L588] CALL assume(!((var7 == 1 & var39 == 1 & var56 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L588] RET assume(!((var7 == 1 & var39 == 1 & var56 == 1) | 0)) [L589] CALL assume(!((var39 == 1 & var40 == 1 & var95 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L589] RET assume(!((var39 == 1 & var40 == 1 & var95 == 1) | 0)) [L590] CALL assume(!((var40 == 1 & var73 == 1 & var86 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L590] RET assume(!((var40 == 1 & var73 == 1 & var86 == 1) | 0)) [L591] CALL assume(!((var1 == 1 & var81 == 1 & var95 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L591] RET assume(!((var1 == 1 & var81 == 1 & var95 == 1) | 0)) [L592] CALL assume(!((var36 == 1 & var55 == 1 & var94 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L592] RET assume(!((var36 == 1 & var55 == 1 & var94 == 1) | 0)) [L593] CALL assume(!((var24 == 1 & var31 == 1 & var88 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L593] RET assume(!((var24 == 1 & var31 == 1 & var88 == 1) | 0)) [L594] CALL assume(!((var24 == 1 & var28 == 1 & var80 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L594] RET assume(!((var24 == 1 & var28 == 1 & var80 == 1) | 0)) [L595] CALL assume(!((var7 == 1 & var47 == 1 & var91 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L595] RET assume(!((var7 == 1 & var47 == 1 & var91 == 1) | 0)) [L596] CALL assume(!((var2 == 1 & var6 == 1 & var60 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L596] RET assume(!((var2 == 1 & var6 == 1 & var60 == 1) | 0)) [L597] CALL assume(!((var23 == 1 & var32 == 1 & var89 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L597] RET assume(!((var23 == 1 & var32 == 1 & var89 == 1) | 0)) [L598] CALL assume(!((var29 == 1 & var55 == 1 & var74 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L598] RET assume(!((var29 == 1 & var55 == 1 & var74 == 1) | 0)) [L599] CALL assume(!((var29 == 1 & var58 == 1 & var74 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L599] RET assume(!((var29 == 1 & var58 == 1 & var74 == 1) | 0)) [L600] CALL assume(!((var29 == 1 & var32 == 1 & var88 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L600] RET assume(!((var29 == 1 & var32 == 1 & var88 == 1) | 0)) [L601] CALL assume(!((var20 == 1 & var63 == 1 & var69 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L601] RET assume(!((var20 == 1 & var63 == 1 & var69 == 1) | 0)) [L602] CALL assume(!((var17 == 1 & var71 == 1 & var84 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L602] RET assume(!((var17 == 1 & var71 == 1 & var84 == 1) | 0)) [L603] CALL assume(!((var52 == 1 & var57 == 1 & var71 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L603] RET assume(!((var52 == 1 & var57 == 1 & var71 == 1) | 0)) [L604] CALL assume(!((var28 == 1 & var66 == 1 & var96 == 1) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L604] RET assume(!((var28 == 1 & var66 == 1 & var96 == 1) | 0)) [L605] CALL assume(!((var10 == 1 & var68 == 1 & var79 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L605] RET assume(!((var10 == 1 & var68 == 1 & var79 == 0) | 0)) [L606] CALL assume(!((var48 == 1 & var63 == 1 & var69 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L606] RET assume(!((var48 == 1 & var63 == 1 & var69 == 0) | 0)) [L607] CALL assume(!((var15 == 1 & var48 == 1 & var69 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L607] RET assume(!((var15 == 1 & var48 == 1 & var69 == 0) | 0)) [L608] CALL assume(!((var38 == 1 & var48 == 1 & var63 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L608] RET assume(!((var38 == 1 & var48 == 1 & var63 == 0) | 0)) [L609] CALL assume(!((var15 == 1 & var21 == 1 & var35 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L609] RET assume(!((var15 == 1 & var21 == 1 & var35 == 0) | 0)) [L610] CALL assume(!((var0 == 1 & var21 == 1 & var75 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L610] RET assume(!((var0 == 1 & var21 == 1 & var75 == 0) | 0)) [L611] CALL assume(!((var51 == 1 & var73 == 1 & var86 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L611] RET assume(!((var51 == 1 & var73 == 1 & var86 == 0) | 0)) [L612] CALL assume(!((var1 == 1 & var93 == 1 & var95 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L612] RET assume(!((var1 == 1 & var93 == 1 & var95 == 0) | 0)) [L613] CALL assume(!((var31 == 1 & var81 == 1 & var85 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L613] RET assume(!((var31 == 1 & var81 == 1 & var85 == 0) | 0)) [L614] CALL assume(!((var5 == 1 & var80 == 1 & var91 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L614] RET assume(!((var5 == 1 & var80 == 1 & var91 == 0) | 0)) [L615] CALL assume(!((var6 == 1 & var47 == 1 & var60 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L615] RET assume(!((var6 == 1 & var47 == 1 & var60 == 0) | 0)) [L616] CALL assume(!((var6 == 1 & var60 == 1 & var72 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L616] RET assume(!((var6 == 1 & var60 == 1 & var72 == 0) | 0)) [L617] CALL assume(!((var72 == 1 & var82 == 1 & var87 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L617] RET assume(!((var72 == 1 & var82 == 1 & var87 == 0) | 0)) [L618] CALL assume(!((var55 == 1 & var72 == 1 & var87 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L618] RET assume(!((var55 == 1 & var72 == 1 & var87 == 0) | 0)) [L619] CALL assume(!((var82 == 1 & var87 == 1 & var89 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L619] RET assume(!((var82 == 1 & var87 == 1 & var89 == 0) | 0)) [L620] CALL assume(!((var52 == 1 & var63 == 1 & var71 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L620] RET assume(!((var52 == 1 & var63 == 1 & var71 == 0) | 0)) [L621] CALL assume(!((var12 == 1 & var16 == 1 & var93 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L621] RET assume(!((var12 == 1 & var16 == 1 & var93 == 0) | 0)) [L622] CALL assume(!((var0 == 1 & var4 == 1 & var39 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L622] RET assume(!((var0 == 1 & var4 == 1 & var39 == 0) | 0)) [L623] CALL assume(!((var51 == 1 & var54 == 1 & var74 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L623] RET assume(!((var51 == 1 & var54 == 1 & var74 == 0) | 0)) [L624] CALL assume(!((var38 == 1 & var54 == 1 & var80 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L624] RET assume(!((var38 == 1 & var54 == 1 & var80 == 0) | 0)) [L625] CALL assume(!((var19 == 1 & var20 == 1 & var97 == 0) | 0)) [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L625] RET assume(!((var19 == 1 & var20 == 1 & var97 == 0) | 0)) [L626] reach_error() VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=0, var14=0, var15=0, var16=0, var17=0, var18=0, var19=0, var2=0, var20=0, var21=0, var22=0, var23=0, var24=0, var25=0, var26=0, var27=0, var28=0, var29=0, var3=0, var30=0, var31=0, var32=0, var33=0, var34=0, var35=0, var36=0, var37=0, var38=0, var39=0, var4=0, var40=0, var41=0, var42=0, var43=0, var44=0, var45=0, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=0, var52=0, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=0, var6=0, var60=0, var61=0, var62=0, var63=0, var64=0, var65=0, var66=0, var67=0, var68=0, var69=0, var7=0, var70=0, var71=0, var72=0, var73=0, var74=0, var75=0, var76=0, var77=0, var78=0, var79=0, var8=0, var80=0, var81=0, var82=0, var83=0, var84=0, var85=0, var86=0, var87=0, var88=0, var89=0, var9=0, var90=0, var91=0, var92=0, var93=0, var94=0, var95=0, var96=0, var97=0, var98=0, var99=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 795 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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, 791 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, 791 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=795occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 1582 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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-11 01:08:10,994 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...