./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/Dubois-021.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/Dubois-021.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e914ef70bca7623c78f76c7515a1a020f1916ebb0197185152701ddd5f622073 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:01:54,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:01:54,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:01:54,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:01:54,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:01:54,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:01:54,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:01:54,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:01:54,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:01:54,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:01:54,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:01:54,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:01:54,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:01:54,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:01:54,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:01:54,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:01:54,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:01:54,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:01:54,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:01:54,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:01:54,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:01:54,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:01:54,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:01:54,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:01:54,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:01:54,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:01:54,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:01:54,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:01:54,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:01:54,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:01:54,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:01:54,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:01:54,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:01:54,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:01:54,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:01:54,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:01:54,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:01:54,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:01:54,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:01:54,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:01:54,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:01:54,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 14:01:54,492 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:01:54,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:01:54,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:01:54,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:01:54,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:01:54,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:01:54,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:01:54,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:01:54,500 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:01:54,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:01:54,501 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:01:54,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 14:01:54,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:01:54,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:01:54,503 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:01:54,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:01:54,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:01:54,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:01:54,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:01:54,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:54,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:01:54,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:01:54,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:01:54,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 14:01:54,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 14:01:54,504 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:01:54,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:01:54,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:01:54,505 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:01:54,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e914ef70bca7623c78f76c7515a1a020f1916ebb0197185152701ddd5f622073 [2021-12-21 14:01:54,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:01:54,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:01:54,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:01:54,721 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:01:54,721 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:01:54,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-021.c [2021-12-21 14:01:54,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1778931/d06ca7906280492eacf37db47f3fed0e/FLAG7afbd044d [2021-12-21 14:01:55,174 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:01:55,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c [2021-12-21 14:01:55,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1778931/d06ca7906280492eacf37db47f3fed0e/FLAG7afbd044d [2021-12-21 14:01:55,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1778931/d06ca7906280492eacf37db47f3fed0e [2021-12-21 14:01:55,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:01:55,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:01:55,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:55,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:01:55,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:01:55,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283da943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55, skipping insertion in model container [2021-12-21 14:01:55,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:01:55,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:01:55,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c[15084,15097] [2021-12-21 14:01:55,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:55,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:01:55,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c[15084,15097] [2021-12-21 14:01:55,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:55,591 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:01:55,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55 WrapperNode [2021-12-21 14:01:55,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:55,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:55,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:01:55,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:01:55,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,659 INFO L137 Inliner]: procedures = 13, calls = 175, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 437 [2021-12-21 14:01:55,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:55,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:01:55,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:01:55,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:01:55,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:01:55,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:01:55,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:01:55,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:01:55,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (1/1) ... [2021-12-21 14:01:55,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:55,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:01:55,765 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) [2021-12-21 14:01:55,782 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 [2021-12-21 14:01:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:01:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:01:55,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:01:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 14:01:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-21 14:01:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-21 14:01:55,937 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:01:55,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:01:56,294 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:01:56,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:01:56,310 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 14:01:56,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:01:56 BoogieIcfgContainer [2021-12-21 14:01:56,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:01:56,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:01:56,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:01:56,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:01:56,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:01:55" (1/3) ... [2021-12-21 14:01:56,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4098e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:01:56, skipping insertion in model container [2021-12-21 14:01:56,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:55" (2/3) ... [2021-12-21 14:01:56,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4098e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:01:56, skipping insertion in model container [2021-12-21 14:01:56,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:01:56" (3/3) ... [2021-12-21 14:01:56,318 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-021.c [2021-12-21 14:01:56,321 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:01:56,321 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 14:01:56,355 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:01:56,360 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 [2021-12-21 14:01:56,360 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 14:01:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2021-12-21 14:01:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2021-12-21 14:01:56,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:56,412 INFO L514 BasicCegarLoop]: trace histogram [168, 168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:01:56,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1051410171, now seen corresponding path program 1 times [2021-12-21 14:01:56,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:01:56,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995249546] [2021-12-21 14:01:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:56,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:01:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 14:01:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 14:01:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 14:01:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 14:01:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 14:01:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 14:01:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 14:01:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 14:01:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 14:01:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 14:01:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 14:01:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 14:01:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-21 14:01:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 14:01:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 14:01:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 14:01:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 14:01:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 14:01:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 14:01:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 14:01:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 14:01:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 14:01:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-21 14:01:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 14:01:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-21 14:01:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-21 14:01:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-21 14:01:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-21 14:01:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 14:01:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 14:01:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-21 14:01:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-21 14:01:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-21 14:01:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-21 14:01:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-21 14:01:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-21 14:01:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-21 14:01:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-21 14:01:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-21 14:01:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-21 14:01:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-21 14:01:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-21 14:01:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-12-21 14:01:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-21 14:01:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-21 14:01:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-21 14:01:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-21 14:01:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-21 14:01:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-21 14:01:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-21 14:01:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-21 14:01:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 14:01:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-21 14:01:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-21 14:01:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-21 14:01:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-21 14:01:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-21 14:01:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-21 14:01:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-21 14:01:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-21 14:01:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-21 14:01:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-21 14:01:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-21 14:01:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-21 14:01:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-21 14:01:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-21 14:01:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-21 14:01:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-21 14:01:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-21 14:01:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-12-21 14:01:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-21 14:01:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-12-21 14:01:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2021-12-21 14:01:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-21 14:01:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-12-21 14:01:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-21 14:01:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-12-21 14:01:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2021-12-21 14:01:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2021-12-21 14:01:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2021-12-21 14:01:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-12-21 14:01:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2021-12-21 14:01:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2021-12-21 14:01:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2021-12-21 14:01:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2021-12-21 14:01:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2021-12-21 14:01:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2021-12-21 14:01:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2021-12-21 14:01:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2021-12-21 14:01:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2021-12-21 14:01:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2021-12-21 14:01:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2021-12-21 14:01:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-12-21 14:01:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-12-21 14:01:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2021-12-21 14:01:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2021-12-21 14:01:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2021-12-21 14:01:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2021-12-21 14:01:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2021-12-21 14:01:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2021-12-21 14:01:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2021-12-21 14:01:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2021-12-21 14:01:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2021-12-21 14:01:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2021-12-21 14:01:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2021-12-21 14:01:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 579 [2021-12-21 14:01:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2021-12-21 14:01:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2021-12-21 14:01:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596 [2021-12-21 14:01:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2021-12-21 14:01:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2021-12-21 14:01:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2021-12-21 14:01:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2021-12-21 14:01:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2021-12-21 14:01:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2021-12-21 14:01:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2021-12-21 14:01:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2021-12-21 14:01:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 645 [2021-12-21 14:01:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 651 [2021-12-21 14:01:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 656 [2021-12-21 14:01:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2021-12-21 14:01:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2021-12-21 14:01:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 673 [2021-12-21 14:01:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2021-12-21 14:01:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 684 [2021-12-21 14:01:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 689 [2021-12-21 14:01:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 695 [2021-12-21 14:01:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2021-12-21 14:01:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 705 [2021-12-21 14:01:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 710 [2021-12-21 14:01:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 715 [2021-12-21 14:01:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 720 [2021-12-21 14:01:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 725 [2021-12-21 14:01:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2021-12-21 14:01:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 735 [2021-12-21 14:01:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 740 [2021-12-21 14:01:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-12-21 14:01:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 750 [2021-12-21 14:01:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 755 [2021-12-21 14:01:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 760 [2021-12-21 14:01:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 765 [2021-12-21 14:01:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 770 [2021-12-21 14:01:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2021-12-21 14:01:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2021-12-21 14:01:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2021-12-21 14:01:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2021-12-21 14:01:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 795 [2021-12-21 14:01:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 800 [2021-12-21 14:01:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 805 [2021-12-21 14:01:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 810 [2021-12-21 14:01:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 815 [2021-12-21 14:01:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 820 [2021-12-21 14:01:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 825 [2021-12-21 14:01:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 830 [2021-12-21 14:01:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 835 [2021-12-21 14:01:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 840 [2021-12-21 14:01:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 845 [2021-12-21 14:01:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 850 [2021-12-21 14:01:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 855 [2021-12-21 14:01:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 860 [2021-12-21 14:01:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 865 [2021-12-21 14:01:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2021-12-21 14:01:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2021-12-21 14:01:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2021-12-21 14:01:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 885 [2021-12-21 14:01:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 890 [2021-12-21 14:01:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 895 [2021-12-21 14:01:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 900 [2021-12-21 14:01:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 56112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56112 trivial. 0 not checked. [2021-12-21 14:01:57,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:01:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995249546] [2021-12-21 14:01:57,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995249546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:01:57,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:01:57,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:01:57,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584343446] [2021-12-21 14:01:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:01:57,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 14:01:57,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:01:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 14:01:57,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:01:57,582 INFO L87 Difference]: Start difference. First operand has 242 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 1 states have call predecessors, (168), 2 states have call successors, (168) [2021-12-21 14:01:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:01:57,629 INFO L93 Difference]: Finished difference Result 478 states and 980 transitions. [2021-12-21 14:01:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 14:01:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 1 states have call predecessors, (168), 2 states have call successors, (168) Word has length 906 [2021-12-21 14:01:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:01:57,639 INFO L225 Difference]: With dead ends: 478 [2021-12-21 14:01:57,639 INFO L226 Difference]: Without dead ends: 239 [2021-12-21 14:01:57,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:01:57,647 INFO L933 BasicCegarLoop]: 405 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, 405 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 [2021-12-21 14:01:57,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 14:01:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-21 14:01:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-12-21 14:01:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 69 states have (on average 1.0) internal successors, (69), 69 states have internal predecessors, (69), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2021-12-21 14:01:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 405 transitions. [2021-12-21 14:01:57,718 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 405 transitions. Word has length 906 [2021-12-21 14:01:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:01:57,718 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 405 transitions. [2021-12-21 14:01:57,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 1 states have call predecessors, (168), 2 states have call successors, (168) [2021-12-21 14:01:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 405 transitions. [2021-12-21 14:01:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2021-12-21 14:01:57,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:57,745 INFO L514 BasicCegarLoop]: trace histogram [168, 168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:01:57,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 14:01:57,746 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 698787323, now seen corresponding path program 1 times [2021-12-21 14:01:57,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:01:57,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260099541] [2021-12-21 14:01:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:57,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:01:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:01:58,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 14:01:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:01:58,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 14:01:58,437 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 14:01:58,438 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 14:01:58,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 14:01:58,442 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-21 14:01:58,446 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 14:01:58,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:01:58 BoogieIcfgContainer [2021-12-21 14:01:58,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 14:01:58,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 14:01:58,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 14:01:58,639 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 14:01:58,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:01:56" (3/4) ... [2021-12-21 14:01:58,641 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 14:01:58,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 14:01:58,642 INFO L158 Benchmark]: Toolchain (without parser) took 3446.95ms. Allocated memory was 100.7MB in the beginning and 157.3MB in the end (delta: 56.6MB). Free memory was 68.7MB in the beginning and 105.8MB in the end (delta: -37.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,643 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:01:58,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.57ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 60.8MB in the end (delta: 7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.87ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 55.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,645 INFO L158 Benchmark]: Boogie Preprocessor took 76.07ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 51.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,646 INFO L158 Benchmark]: RCFGBuilder took 574.86ms. Allocated memory is still 100.7MB. Free memory was 51.8MB in the beginning and 68.7MB in the end (delta: -16.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,646 INFO L158 Benchmark]: TraceAbstraction took 2324.90ms. Allocated memory was 100.7MB in the beginning and 157.3MB in the end (delta: 56.6MB). Free memory was 68.1MB in the beginning and 105.8MB in the end (delta: -37.6MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2021-12-21 14:01:58,647 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 157.3MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:01:58,649 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.16ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.57ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 60.8MB in the end (delta: 7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.87ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 55.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.07ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 51.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.86ms. Allocated memory is still 100.7MB. Free memory was 51.8MB in the beginning and 68.7MB in the end (delta: -16.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2324.90ms. Allocated memory was 100.7MB in the beginning and 157.3MB in the end (delta: 56.6MB). Free memory was 68.1MB in the beginning and 105.8MB in the end (delta: -37.6MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 157.3MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 446]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 442. Possible FailurePath: [L22] int cond0; [L23] int dummy = 0; [L24] int N; [L25] int var0; [L26] var0 = __VERIFIER_nondet_int() [L27] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) VAL [dummy=0, var0=1] [L28] CALL assume(var0 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) VAL [dummy=0, var0=1] [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) VAL [dummy=0, var0=1, var1=0] [L32] CALL assume(var1 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) VAL [dummy=0, var0=1, var1=0] [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0] [L36] CALL assume(var2 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0] [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0] [L40] CALL assume(var3 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0] [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0] [L44] CALL assume(var4 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0] [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1] [L48] CALL assume(var5 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1] [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0] [L56] CALL assume(var7 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0] [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0] [L60] CALL assume(var8 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0] [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L64] CALL assume(var9 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) VAL [dummy=0, var0=1, var1=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L68] CALL assume(var10 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L72] CALL assume(var11 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L76] CALL assume(var12 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L80] CALL assume(var13 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L84] CALL assume(var14 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L88] CALL assume(var15 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L92] CALL assume(var16 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L96] CALL assume(var17 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L100] CALL assume(var18 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L104] CALL assume(var19 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L108] CALL assume(var20 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L112] CALL assume(var21 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L116] CALL assume(var22 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L120] CALL assume(var23 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L124] CALL assume(var24 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L128] CALL assume(var25 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L132] CALL assume(var26 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L136] CALL assume(var27 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L140] CALL assume(var28 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L144] CALL assume(var29 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L148] CALL assume(var30 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L152] CALL assume(var31 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L156] CALL assume(var32 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L160] CALL assume(var33 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L164] CALL assume(var34 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L168] CALL assume(var35 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L172] CALL assume(var36 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L176] CALL assume(var37 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L180] CALL assume(var38 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L184] CALL assume(var39 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L188] CALL assume(var40 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L192] CALL assume(var41 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L196] CALL assume(var42 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L200] CALL assume(var43 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L204] CALL assume(var44 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L205] int var45; [L206] var45 = __VERIFIER_nondet_int() [L207] CALL assume(var45 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var45 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L208] CALL assume(var45 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var45 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L209] int var46; [L210] var46 = __VERIFIER_nondet_int() [L211] CALL assume(var46 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var46 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L212] CALL assume(var46 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var46 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L213] int var47; [L214] var47 = __VERIFIER_nondet_int() [L215] CALL assume(var47 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var47 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L216] CALL assume(var47 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L216] RET assume(var47 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L217] int var48; [L218] var48 = __VERIFIER_nondet_int() [L219] CALL assume(var48 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L219] RET assume(var48 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L220] CALL assume(var48 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L220] RET assume(var48 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var5=1, var6=0, var7=0, var8=0, var9=1] [L221] int var49; [L222] var49 = __VERIFIER_nondet_int() [L223] CALL assume(var49 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L223] RET assume(var49 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L224] CALL assume(var49 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var49 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var6=0, var7=0, var8=0, var9=1] [L225] int var50; [L226] var50 = __VERIFIER_nondet_int() [L227] CALL assume(var50 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var50 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var6=0, var7=0, var8=0, var9=1] [L228] CALL assume(var50 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L228] RET assume(var50 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var6=0, var7=0, var8=0, var9=1] [L229] int var51; [L230] var51 = __VERIFIER_nondet_int() [L231] CALL assume(var51 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L231] RET assume(var51 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var6=0, var7=0, var8=0, var9=1] [L232] CALL assume(var51 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L232] RET assume(var51 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var6=0, var7=0, var8=0, var9=1] [L233] int var52; [L234] var52 = __VERIFIER_nondet_int() [L235] CALL assume(var52 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L235] RET assume(var52 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var6=0, var7=0, var8=0, var9=1] [L236] CALL assume(var52 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L236] RET assume(var52 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var6=0, var7=0, var8=0, var9=1] [L237] int var53; [L238] var53 = __VERIFIER_nondet_int() [L239] CALL assume(var53 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L239] RET assume(var53 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var6=0, var7=0, var8=0, var9=1] [L240] CALL assume(var53 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L240] RET assume(var53 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var6=0, var7=0, var8=0, var9=1] [L241] int var54; [L242] var54 = __VERIFIER_nondet_int() [L243] CALL assume(var54 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L243] RET assume(var54 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var6=0, var7=0, var8=0, var9=1] [L244] CALL assume(var54 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L244] RET assume(var54 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var6=0, var7=0, var8=0, var9=1] [L245] int var55; [L246] var55 = __VERIFIER_nondet_int() [L247] CALL assume(var55 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L247] RET assume(var55 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var6=0, var7=0, var8=0, var9=1] [L248] CALL assume(var55 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L248] RET assume(var55 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var6=0, var7=0, var8=0, var9=1] [L249] int var56; [L250] var56 = __VERIFIER_nondet_int() [L251] CALL assume(var56 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L251] RET assume(var56 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var6=0, var7=0, var8=0, var9=1] [L252] CALL assume(var56 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L252] RET assume(var56 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var6=0, var7=0, var8=0, var9=1] [L253] int var57; [L254] var57 = __VERIFIER_nondet_int() [L255] CALL assume(var57 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L255] RET assume(var57 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var6=0, var7=0, var8=0, var9=1] [L256] CALL assume(var57 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L256] RET assume(var57 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var6=0, var7=0, var8=0, var9=1] [L257] int var58; [L258] var58 = __VERIFIER_nondet_int() [L259] CALL assume(var58 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L259] RET assume(var58 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var6=0, var7=0, var8=0, var9=1] [L260] CALL assume(var58 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L260] RET assume(var58 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var6=0, var7=0, var8=0, var9=1] [L261] int var59; [L262] var59 = __VERIFIER_nondet_int() [L263] CALL assume(var59 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L263] RET assume(var59 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var7=0, var8=0, var9=1] [L264] CALL assume(var59 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L264] RET assume(var59 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var7=0, var8=0, var9=1] [L265] int var60; [L266] var60 = __VERIFIER_nondet_int() [L267] CALL assume(var60 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L267] RET assume(var60 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var7=0, var8=0, var9=1] [L268] CALL assume(var60 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L268] RET assume(var60 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var7=0, var8=0, var9=1] [L269] int var61; [L270] var61 = __VERIFIER_nondet_int() [L271] CALL assume(var61 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L271] RET assume(var61 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var7=0, var8=0, var9=1] [L272] CALL assume(var61 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L272] RET assume(var61 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var7=0, var8=0, var9=1] [L273] int var62; [L274] var62 = __VERIFIER_nondet_int() [L275] CALL assume(var62 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L275] RET assume(var62 >= 0) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L276] CALL assume(var62 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L276] RET assume(var62 <= 1) VAL [dummy=0, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L277] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L278-L281] CALL assume((var40 == 0 & var41 == 0 & var0 == 1) | (var40 == 0 & var41 == 1 & var0 == 0) | (var40 == 1 & var41 == 0 & var0 == 0) | (var40 == 1 & var41 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=82, cond=82] [L278-L281] RET assume((var40 == 0 & var41 == 0 & var0 == 1) | (var40 == 0 & var41 == 1 & var0 == 0) | (var40 == 1 & var41 == 0 & var0 == 0) | (var40 == 1 & var41 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L282-L285] CALL assume((var1 == 0 & var43 == 0 & var2 == 1) | (var1 == 0 & var43 == 1 & var2 == 0) | (var1 == 1 & var43 == 0 & var2 == 0) | (var1 == 1 & var43 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L282-L285] RET assume((var1 == 0 & var43 == 0 & var2 == 1) | (var1 == 0 & var43 == 1 & var2 == 0) | (var1 == 1 & var43 == 0 & var2 == 0) | (var1 == 1 & var43 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L286-L289] CALL assume((var2 == 0 & var44 == 0 & var3 == 1) | (var2 == 0 & var44 == 1 & var3 == 0) | (var2 == 1 & var44 == 0 & var3 == 0) | (var2 == 1 & var44 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L286-L289] RET assume((var2 == 0 & var44 == 0 & var3 == 1) | (var2 == 0 & var44 == 1 & var3 == 0) | (var2 == 1 & var44 == 0 & var3 == 0) | (var2 == 1 & var44 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L290-L293] CALL assume((var3 == 0 & var45 == 0 & var4 == 1) | (var3 == 0 & var45 == 1 & var4 == 0) | (var3 == 1 & var45 == 0 & var4 == 0) | (var3 == 1 & var45 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L290-L293] RET assume((var3 == 0 & var45 == 0 & var4 == 1) | (var3 == 0 & var45 == 1 & var4 == 0) | (var3 == 1 & var45 == 0 & var4 == 0) | (var3 == 1 & var45 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L294-L297] CALL assume((var4 == 0 & var46 == 0 & var5 == 1) | (var4 == 0 & var46 == 1 & var5 == 0) | (var4 == 1 & var46 == 0 & var5 == 0) | (var4 == 1 & var46 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L294-L297] RET assume((var4 == 0 & var46 == 0 & var5 == 1) | (var4 == 0 & var46 == 1 & var5 == 0) | (var4 == 1 & var46 == 0 & var5 == 0) | (var4 == 1 & var46 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L298-L301] CALL assume((var5 == 0 & var47 == 0 & var6 == 1) | (var5 == 0 & var47 == 1 & var6 == 0) | (var5 == 1 & var47 == 0 & var6 == 0) | (var5 == 1 & var47 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L298-L301] RET assume((var5 == 0 & var47 == 0 & var6 == 1) | (var5 == 0 & var47 == 1 & var6 == 0) | (var5 == 1 & var47 == 0 & var6 == 0) | (var5 == 1 & var47 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L302-L305] CALL assume((var6 == 0 & var48 == 0 & var7 == 1) | (var6 == 0 & var48 == 1 & var7 == 0) | (var6 == 1 & var48 == 0 & var7 == 0) | (var6 == 1 & var48 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=84, cond=84] [L302-L305] RET assume((var6 == 0 & var48 == 0 & var7 == 1) | (var6 == 0 & var48 == 1 & var7 == 0) | (var6 == 1 & var48 == 0 & var7 == 0) | (var6 == 1 & var48 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L306-L309] CALL assume((var7 == 0 & var49 == 0 & var8 == 1) | (var7 == 0 & var49 == 1 & var8 == 0) | (var7 == 1 & var49 == 0 & var8 == 0) | (var7 == 1 & var49 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=85, cond=85] [L306-L309] RET assume((var7 == 0 & var49 == 0 & var8 == 1) | (var7 == 0 & var49 == 1 & var8 == 0) | (var7 == 1 & var49 == 0 & var8 == 0) | (var7 == 1 & var49 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L310-L313] CALL assume((var8 == 0 & var50 == 0 & var9 == 1) | (var8 == 0 & var50 == 1 & var9 == 0) | (var8 == 1 & var50 == 0 & var9 == 0) | (var8 == 1 & var50 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=81, cond=81] [L310-L313] RET assume((var8 == 0 & var50 == 0 & var9 == 1) | (var8 == 0 & var50 == 1 & var9 == 0) | (var8 == 1 & var50 == 0 & var9 == 0) | (var8 == 1 & var50 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L314-L317] CALL assume((var9 == 0 & var51 == 0 & var10 == 1) | (var9 == 0 & var51 == 1 & var10 == 0) | (var9 == 1 & var51 == 0 & var10 == 0) | (var9 == 1 & var51 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L314-L317] RET assume((var9 == 0 & var51 == 0 & var10 == 1) | (var9 == 0 & var51 == 1 & var10 == 0) | (var9 == 1 & var51 == 0 & var10 == 0) | (var9 == 1 & var51 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L318-L321] CALL assume((var10 == 0 & var52 == 0 & var11 == 1) | (var10 == 0 & var52 == 1 & var11 == 0) | (var10 == 1 & var52 == 0 & var11 == 0) | (var10 == 1 & var52 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L318-L321] RET assume((var10 == 0 & var52 == 0 & var11 == 1) | (var10 == 0 & var52 == 1 & var11 == 0) | (var10 == 1 & var52 == 0 & var11 == 0) | (var10 == 1 & var52 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L322-L325] CALL assume((var11 == 0 & var53 == 0 & var12 == 1) | (var11 == 0 & var53 == 1 & var12 == 0) | (var11 == 1 & var53 == 0 & var12 == 0) | (var11 == 1 & var53 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L322-L325] RET assume((var11 == 0 & var53 == 0 & var12 == 1) | (var11 == 0 & var53 == 1 & var12 == 0) | (var11 == 1 & var53 == 0 & var12 == 0) | (var11 == 1 & var53 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L326-L329] CALL assume((var12 == 0 & var54 == 0 & var13 == 1) | (var12 == 0 & var54 == 1 & var13 == 0) | (var12 == 1 & var54 == 0 & var13 == 0) | (var12 == 1 & var54 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L326-L329] RET assume((var12 == 0 & var54 == 0 & var13 == 1) | (var12 == 0 & var54 == 1 & var13 == 0) | (var12 == 1 & var54 == 0 & var13 == 0) | (var12 == 1 & var54 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L330-L333] CALL assume((var13 == 0 & var55 == 0 & var14 == 1) | (var13 == 0 & var55 == 1 & var14 == 0) | (var13 == 1 & var55 == 0 & var14 == 0) | (var13 == 1 & var55 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=86, cond=86] [L330-L333] RET assume((var13 == 0 & var55 == 0 & var14 == 1) | (var13 == 0 & var55 == 1 & var14 == 0) | (var13 == 1 & var55 == 0 & var14 == 0) | (var13 == 1 & var55 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L334-L337] CALL assume((var14 == 0 & var56 == 0 & var15 == 1) | (var14 == 0 & var56 == 1 & var15 == 0) | (var14 == 1 & var56 == 0 & var15 == 0) | (var14 == 1 & var56 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=79, cond=79] [L334-L337] RET assume((var14 == 0 & var56 == 0 & var15 == 1) | (var14 == 0 & var56 == 1 & var15 == 0) | (var14 == 1 & var56 == 0 & var15 == 0) | (var14 == 1 & var56 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L338-L341] CALL assume((var15 == 0 & var57 == 0 & var16 == 1) | (var15 == 0 & var57 == 1 & var16 == 0) | (var15 == 1 & var57 == 0 & var16 == 0) | (var15 == 1 & var57 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L338-L341] RET assume((var15 == 0 & var57 == 0 & var16 == 1) | (var15 == 0 & var57 == 1 & var16 == 0) | (var15 == 1 & var57 == 0 & var16 == 0) | (var15 == 1 & var57 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L342-L345] CALL assume((var16 == 0 & var58 == 0 & var17 == 1) | (var16 == 0 & var58 == 1 & var17 == 0) | (var16 == 1 & var58 == 0 & var17 == 0) | (var16 == 1 & var58 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L342-L345] RET assume((var16 == 0 & var58 == 0 & var17 == 1) | (var16 == 0 & var58 == 1 & var17 == 0) | (var16 == 1 & var58 == 0 & var17 == 0) | (var16 == 1 & var58 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L346-L349] CALL assume((var17 == 0 & var59 == 0 & var18 == 1) | (var17 == 0 & var59 == 1 & var18 == 0) | (var17 == 1 & var59 == 0 & var18 == 0) | (var17 == 1 & var59 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L346-L349] RET assume((var17 == 0 & var59 == 0 & var18 == 1) | (var17 == 0 & var59 == 1 & var18 == 0) | (var17 == 1 & var59 == 0 & var18 == 0) | (var17 == 1 & var59 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L350-L353] CALL assume((var18 == 0 & var60 == 0 & var19 == 1) | (var18 == 0 & var60 == 1 & var19 == 0) | (var18 == 1 & var60 == 0 & var19 == 0) | (var18 == 1 & var60 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L350-L353] RET assume((var18 == 0 & var60 == 0 & var19 == 1) | (var18 == 0 & var60 == 1 & var19 == 0) | (var18 == 1 & var60 == 0 & var19 == 0) | (var18 == 1 & var60 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L354-L357] CALL assume((var0 == 0 & var42 == 0 & var1 == 1) | (var0 == 0 & var42 == 1 & var1 == 0) | (var0 == 1 & var42 == 0 & var1 == 0) | (var0 == 1 & var42 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L354-L357] RET assume((var0 == 0 & var42 == 0 & var1 == 1) | (var0 == 0 & var42 == 1 & var1 == 0) | (var0 == 1 & var42 == 0 & var1 == 0) | (var0 == 1 & var42 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L358-L361] CALL assume((var20 == 0 & var61 == 0 & var62 == 1) | (var20 == 0 & var61 == 1 & var62 == 0) | (var20 == 1 & var61 == 0 & var62 == 0) | (var20 == 1 & var61 == 1 & var62 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L358-L361] RET assume((var20 == 0 & var61 == 0 & var62 == 1) | (var20 == 0 & var61 == 1 & var62 == 0) | (var20 == 1 & var61 == 0 & var62 == 0) | (var20 == 1 & var61 == 1 & var62 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L362-L365] CALL assume((var19 == 0 & var61 == 0 & var62 == 1) | (var19 == 0 & var61 == 1 & var62 == 0) | (var19 == 1 & var61 == 0 & var62 == 0) | (var19 == 1 & var61 == 1 & var62 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L362-L365] RET assume((var19 == 0 & var61 == 0 & var62 == 1) | (var19 == 0 & var61 == 1 & var62 == 0) | (var19 == 1 & var61 == 0 & var62 == 0) | (var19 == 1 & var61 == 1 & var62 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L366-L369] CALL assume((var22 == 0 & var59 == 0 & var21 == 1) | (var22 == 0 & var59 == 1 & var21 == 0) | (var22 == 1 & var59 == 0 & var21 == 0) | (var22 == 1 & var59 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L366-L369] RET assume((var22 == 0 & var59 == 0 & var21 == 1) | (var22 == 0 & var59 == 1 & var21 == 0) | (var22 == 1 & var59 == 0 & var21 == 0) | (var22 == 1 & var59 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L370-L373] CALL assume((var23 == 0 & var58 == 0 & var22 == 1) | (var23 == 0 & var58 == 1 & var22 == 0) | (var23 == 1 & var58 == 0 & var22 == 0) | (var23 == 1 & var58 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L370-L373] RET assume((var23 == 0 & var58 == 0 & var22 == 1) | (var23 == 0 & var58 == 1 & var22 == 0) | (var23 == 1 & var58 == 0 & var22 == 0) | (var23 == 1 & var58 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L374-L377] CALL assume((var24 == 0 & var57 == 0 & var23 == 1) | (var24 == 0 & var57 == 1 & var23 == 0) | (var24 == 1 & var57 == 0 & var23 == 0) | (var24 == 1 & var57 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L374-L377] RET assume((var24 == 0 & var57 == 0 & var23 == 1) | (var24 == 0 & var57 == 1 & var23 == 0) | (var24 == 1 & var57 == 0 & var23 == 0) | (var24 == 1 & var57 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L378-L381] CALL assume((var25 == 0 & var56 == 0 & var24 == 1) | (var25 == 0 & var56 == 1 & var24 == 0) | (var25 == 1 & var56 == 0 & var24 == 0) | (var25 == 1 & var56 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L378-L381] RET assume((var25 == 0 & var56 == 0 & var24 == 1) | (var25 == 0 & var56 == 1 & var24 == 0) | (var25 == 1 & var56 == 0 & var24 == 0) | (var25 == 1 & var56 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L382-L385] CALL assume((var26 == 0 & var55 == 0 & var25 == 1) | (var26 == 0 & var55 == 1 & var25 == 0) | (var26 == 1 & var55 == 0 & var25 == 0) | (var26 == 1 & var55 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L382-L385] RET assume((var26 == 0 & var55 == 0 & var25 == 1) | (var26 == 0 & var55 == 1 & var25 == 0) | (var26 == 1 & var55 == 0 & var25 == 0) | (var26 == 1 & var55 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L386-L389] CALL assume((var27 == 0 & var54 == 0 & var26 == 1) | (var27 == 0 & var54 == 1 & var26 == 0) | (var27 == 1 & var54 == 0 & var26 == 0) | (var27 == 1 & var54 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=89, cond=89] [L386-L389] RET assume((var27 == 0 & var54 == 0 & var26 == 1) | (var27 == 0 & var54 == 1 & var26 == 0) | (var27 == 1 & var54 == 0 & var26 == 0) | (var27 == 1 & var54 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L390-L393] CALL assume((var28 == 0 & var53 == 0 & var27 == 1) | (var28 == 0 & var53 == 1 & var27 == 0) | (var28 == 1 & var53 == 0 & var27 == 0) | (var28 == 1 & var53 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L390-L393] RET assume((var28 == 0 & var53 == 0 & var27 == 1) | (var28 == 0 & var53 == 1 & var27 == 0) | (var28 == 1 & var53 == 0 & var27 == 0) | (var28 == 1 & var53 == 1 & var27 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L394-L397] CALL assume((var29 == 0 & var52 == 0 & var28 == 1) | (var29 == 0 & var52 == 1 & var28 == 0) | (var29 == 1 & var52 == 0 & var28 == 0) | (var29 == 1 & var52 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L394-L397] RET assume((var29 == 0 & var52 == 0 & var28 == 1) | (var29 == 0 & var52 == 1 & var28 == 0) | (var29 == 1 & var52 == 0 & var28 == 0) | (var29 == 1 & var52 == 1 & var28 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L398-L401] CALL assume((var30 == 0 & var51 == 0 & var29 == 1) | (var30 == 0 & var51 == 1 & var29 == 0) | (var30 == 1 & var51 == 0 & var29 == 0) | (var30 == 1 & var51 == 1 & var29 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L398-L401] RET assume((var30 == 0 & var51 == 0 & var29 == 1) | (var30 == 0 & var51 == 1 & var29 == 0) | (var30 == 1 & var51 == 0 & var29 == 0) | (var30 == 1 & var51 == 1 & var29 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L402-L405] CALL assume((var31 == 0 & var50 == 0 & var30 == 1) | (var31 == 0 & var50 == 1 & var30 == 0) | (var31 == 1 & var50 == 0 & var30 == 0) | (var31 == 1 & var50 == 1 & var30 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=80, cond=80] [L402-L405] RET assume((var31 == 0 & var50 == 0 & var30 == 1) | (var31 == 0 & var50 == 1 & var30 == 0) | (var31 == 1 & var50 == 0 & var30 == 0) | (var31 == 1 & var50 == 1 & var30 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L406-L409] CALL assume((var32 == 0 & var49 == 0 & var31 == 1) | (var32 == 0 & var49 == 1 & var31 == 0) | (var32 == 1 & var49 == 0 & var31 == 0) | (var32 == 1 & var49 == 1 & var31 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L406-L409] RET assume((var32 == 0 & var49 == 0 & var31 == 1) | (var32 == 0 & var49 == 1 & var31 == 0) | (var32 == 1 & var49 == 0 & var31 == 0) | (var32 == 1 & var49 == 1 & var31 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L410-L413] CALL assume((var33 == 0 & var48 == 0 & var32 == 1) | (var33 == 0 & var48 == 1 & var32 == 0) | (var33 == 1 & var48 == 0 & var32 == 0) | (var33 == 1 & var48 == 1 & var32 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L410-L413] RET assume((var33 == 0 & var48 == 0 & var32 == 1) | (var33 == 0 & var48 == 1 & var32 == 0) | (var33 == 1 & var48 == 0 & var32 == 0) | (var33 == 1 & var48 == 1 & var32 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L414-L417] CALL assume((var34 == 0 & var47 == 0 & var33 == 1) | (var34 == 0 & var47 == 1 & var33 == 0) | (var34 == 1 & var47 == 0 & var33 == 0) | (var34 == 1 & var47 == 1 & var33 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=83, cond=83] [L414-L417] RET assume((var34 == 0 & var47 == 0 & var33 == 1) | (var34 == 0 & var47 == 1 & var33 == 0) | (var34 == 1 & var47 == 0 & var33 == 0) | (var34 == 1 & var47 == 1 & var33 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L418-L421] CALL assume((var35 == 0 & var46 == 0 & var34 == 1) | (var35 == 0 & var46 == 1 & var34 == 0) | (var35 == 1 & var46 == 0 & var34 == 0) | (var35 == 1 & var46 == 1 & var34 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L418-L421] RET assume((var35 == 0 & var46 == 0 & var34 == 1) | (var35 == 0 & var46 == 1 & var34 == 0) | (var35 == 1 & var46 == 0 & var34 == 0) | (var35 == 1 & var46 == 1 & var34 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L422-L425] CALL assume((var36 == 0 & var45 == 0 & var35 == 1) | (var36 == 0 & var45 == 1 & var35 == 0) | (var36 == 1 & var45 == 0 & var35 == 0) | (var36 == 1 & var45 == 1 & var35 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=87, cond=87] [L422-L425] RET assume((var36 == 0 & var45 == 0 & var35 == 1) | (var36 == 0 & var45 == 1 & var35 == 0) | (var36 == 1 & var45 == 0 & var35 == 0) | (var36 == 1 & var45 == 1 & var35 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L426-L429] CALL assume((var37 == 0 & var44 == 0 & var36 == 1) | (var37 == 0 & var44 == 1 & var36 == 0) | (var37 == 1 & var44 == 0 & var36 == 0) | (var37 == 1 & var44 == 1 & var36 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L426-L429] RET assume((var37 == 0 & var44 == 0 & var36 == 1) | (var37 == 0 & var44 == 1 & var36 == 0) | (var37 == 1 & var44 == 0 & var36 == 0) | (var37 == 1 & var44 == 1 & var36 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L430-L433] CALL assume((var38 == 0 & var43 == 0 & var37 == 1) | (var38 == 0 & var43 == 1 & var37 == 0) | (var38 == 1 & var43 == 0 & var37 == 0) | (var38 == 1 & var43 == 1 & var37 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L430-L433] RET assume((var38 == 0 & var43 == 0 & var37 == 1) | (var38 == 0 & var43 == 1 & var37 == 0) | (var38 == 1 & var43 == 0 & var37 == 0) | (var38 == 1 & var43 == 1 & var37 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L434-L437] CALL assume((var39 == 0 & var42 == 0 & var38 == 1) | (var39 == 0 & var42 == 1 & var38 == 0) | (var39 == 1 & var42 == 0 & var38 == 0) | (var39 == 1 & var42 == 1 & var38 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=88, cond=88] [L434-L437] RET assume((var39 == 0 & var42 == 0 & var38 == 1) | (var39 == 0 & var42 == 1 & var38 == 0) | (var39 == 1 & var42 == 0 & var38 == 0) | (var39 == 1 & var42 == 1 & var38 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L438-L441] CALL assume((var21 == 0 & var60 == 0 & var20 == 1) | (var21 == 0 & var60 == 1 & var20 == 0) | (var21 == 1 & var60 == 0 & var20 == 0) | (var21 == 1 & var60 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L438-L441] RET assume((var21 == 0 & var60 == 0 & var20 == 1) | (var21 == 0 & var60 == 1 & var20 == 0) | (var21 == 1 & var60 == 0 & var20 == 0) | (var21 == 1 & var60 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L442-L445] CALL assume((var40 == 0 & var41 == 0 & var39 == 0) | (var40 == 0 & var41 == 1 & var39 == 1) | (var40 == 1 & var41 == 0 & var39 == 1) | (var40 == 1 & var41 == 1 & var39 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=90, cond=90] [L442-L445] RET assume((var40 == 0 & var41 == 0 & var39 == 0) | (var40 == 0 & var41 == 1 & var39 == 1) | (var40 == 1 & var41 == 0 & var39 == 1) | (var40 == 1 & var41 == 1 & var39 == 0) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] [L446] reach_error() VAL [dummy=0, myvar0=1, var0=1, var1=0, var10=0, var11=1, var12=0, var13=0, var14=0, var15=1, var16=1, var17=0, var18=0, var19=0, var2=0, var20=0, var21=1, var22=1, var23=1, var24=0, var25=1, var26=0, var27=1, var28=1, var29=1, var3=0, var30=0, var31=1, var32=0, var33=0, var34=0, var35=0, var36=0, var37=1, var38=1, var39=1, var4=0, var40=0, var41=0, var42=1, var43=0, var44=0, var45=1, var46=0, var47=1, var48=0, var49=1, var5=1, var50=0, var51=1, var52=1, var53=0, var54=0, var55=0, var56=0, var57=0, var58=0, var59=1, var6=0, var60=1, var61=0, var62=0, var7=0, var8=0, var9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 168, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 405 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, 405 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1812 NumberOfCodeBlocks, 1812 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 905 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 56112/56112 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 [2021-12-21 14:01:58,685 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/Dubois-021.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e914ef70bca7623c78f76c7515a1a020f1916ebb0197185152701ddd5f622073 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:02:00,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:02:00,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:02:00,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:02:00,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:02:00,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:02:00,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:02:00,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:02:00,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:02:00,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:02:00,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:02:00,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:02:00,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:02:00,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:02:00,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:02:00,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:02:00,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:02:00,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:02:00,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:02:00,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:02:00,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:02:00,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:02:00,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:02:00,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:02:00,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:02:00,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:02:00,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:02:00,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:02:00,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:02:00,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:02:00,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:02:00,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:02:00,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:02:00,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:02:00,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:02:00,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:02:00,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:02:00,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:02:00,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:02:00,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:02:00,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:02:00,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-21 14:02:00,520 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:02:00,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:02:00,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:02:00,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:02:00,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:02:00,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:02:00,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:02:00,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:02:00,524 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:02:00,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:02:00,525 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:02:00,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:02:00,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:02:00,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:02:00,527 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:02:00,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 14:02:00,529 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e914ef70bca7623c78f76c7515a1a020f1916ebb0197185152701ddd5f622073 [2021-12-21 14:02:00,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:02:00,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:02:00,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:02:00,799 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:02:00,808 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:02:00,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-021.c [2021-12-21 14:02:00,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c421361c/7a243a0ea8e24e1cb15e0e927df7f343/FLAGacc3c6064 [2021-12-21 14:02:01,241 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:02:01,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c [2021-12-21 14:02:01,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c421361c/7a243a0ea8e24e1cb15e0e927df7f343/FLAGacc3c6064 [2021-12-21 14:02:01,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c421361c/7a243a0ea8e24e1cb15e0e927df7f343 [2021-12-21 14:02:01,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:02:01,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:02:01,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:02:01,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:02:01,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:02:01,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acd0455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01, skipping insertion in model container [2021-12-21 14:02:01,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:02:01,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:02:01,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c[15084,15097] [2021-12-21 14:02:01,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:02:01,557 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:02:01,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-021.c[15084,15097] [2021-12-21 14:02:01,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:02:01,648 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:02:01,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01 WrapperNode [2021-12-21 14:02:01,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:02:01,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:02:01,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:02:01,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:02:01,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,728 INFO L137 Inliner]: procedures = 13, calls = 175, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 374 [2021-12-21 14:02:01,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:02:01,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:02:01,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:02:01,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:02:01,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:02:01,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:02:01,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:02:01,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:02:01,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (1/1) ... [2021-12-21 14:02:01,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:02:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:02:01,825 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) [2021-12-21 14:02:01,847 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 [2021-12-21 14:02:01,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:02:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:02:01,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:02:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 14:02:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-21 14:02:01,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-21 14:02:01,987 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:02:01,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:02:02,331 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:02:02,342 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:02:02,342 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 14:02:02,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:02:02 BoogieIcfgContainer [2021-12-21 14:02:02,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:02:02,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:02:02,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:02:02,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:02:02,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:02:01" (1/3) ... [2021-12-21 14:02:02,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79762330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:02:02, skipping insertion in model container [2021-12-21 14:02:02,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:02:01" (2/3) ... [2021-12-21 14:02:02,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79762330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:02:02, skipping insertion in model container [2021-12-21 14:02:02,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:02:02" (3/3) ... [2021-12-21 14:02:02,354 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-021.c [2021-12-21 14:02:02,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:02:02,357 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 14:02:02,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:02:02,414 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 [2021-12-21 14:02:02,414 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 14:02:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2021-12-21 14:02:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2021-12-21 14:02:02,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:02:02,480 INFO L514 BasicCegarLoop]: trace histogram [168, 168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:02:02,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:02:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:02:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1051410171, now seen corresponding path program 1 times [2021-12-21 14:02:02,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 14:02:02,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140027411] [2021-12-21 14:02:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:02:02,504 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 14:02:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 14:02:02,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 14:02:02,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 14:02:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:02:02,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-21 14:02:03,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:02:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 56112 backedges. 28142 proven. 0 refuted. 0 times theorem prover too weak. 27970 trivial. 0 not checked. [2021-12-21 14:02:04,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 14:02:04,234 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 14:02:04,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140027411] [2021-12-21 14:02:04,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140027411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:02:04,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:02:04,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:02:04,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544236611] [2021-12-21 14:02:04,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:02:04,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 14:02:04,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 14:02:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 14:02:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:02:04,261 INFO L87 Difference]: Start difference. First operand has 242 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (168), 2 states have call predecessors, (168), 2 states have return successors, (168), 2 states have call predecessors, (168), 2 states have call successors, (168) [2021-12-21 14:02:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:02:04,313 INFO L93 Difference]: Finished difference Result 478 states and 980 transitions. [2021-12-21 14:02:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 14:02:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (168), 2 states have call predecessors, (168), 2 states have return successors, (168), 2 states have call predecessors, (168), 2 states have call successors, (168) Word has length 906 [2021-12-21 14:02:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:02:04,324 INFO L225 Difference]: With dead ends: 478 [2021-12-21 14:02:04,324 INFO L226 Difference]: Without dead ends: 239 [2021-12-21 14:02:04,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 905 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:02:04,332 INFO L933 BasicCegarLoop]: 405 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, 405 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 [2021-12-21 14:02:04,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 14:02:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-21 14:02:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-12-21 14:02:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 69 states have (on average 1.0) internal successors, (69), 69 states have internal predecessors, (69), 168 states have call successors, (168), 1 states have call predecessors, (168), 1 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2021-12-21 14:02:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 405 transitions. [2021-12-21 14:02:04,411 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 405 transitions. Word has length 906 [2021-12-21 14:02:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:02:04,412 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 405 transitions. [2021-12-21 14:02:04,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (168), 2 states have call predecessors, (168), 2 states have return successors, (168), 2 states have call predecessors, (168), 2 states have call successors, (168) [2021-12-21 14:02:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 405 transitions. [2021-12-21 14:02:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2021-12-21 14:02:04,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:02:04,428 INFO L514 BasicCegarLoop]: trace histogram [168, 168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:02:04,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 14:02:04,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 14:02:04,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:02:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:02:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 698787323, now seen corresponding path program 1 times [2021-12-21 14:02:04,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 14:02:04,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15259842] [2021-12-21 14:02:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:02:04,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 14:02:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 14:02:04,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 14:02:04,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 14:02:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:02:49,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 324 conjunts are in the unsatisfiable core [2021-12-21 14:02:49,658 INFO L286 TraceCheckSpWp]: Computing forward predicates...