./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/Dubois-019.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-019.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 42be0dd7c0591debf7e5f003ab2565c2cee2d060ebc66ea41d5f9c8be093c1f8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:01:46,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:01:46,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:01:46,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:01:46,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:01:46,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:01:46,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:01:46,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:01:46,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:01:46,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:01:46,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:01:46,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:01:46,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:01:46,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:01:46,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:01:46,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:01:46,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:01:46,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:01:46,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:01:46,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:01:46,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:01:46,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:01:46,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:01:46,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:01:46,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:01:46,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:01:46,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:01:46,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:01:46,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:01:46,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:01:46,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:01:46,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:01:46,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:01:46,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:01:46,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:01:46,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:01:46,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:01:46,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:01:46,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:01:46,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:01:46,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:01:46,493 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:46,519 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:01:46,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:01:46,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:01:46,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:01:46,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:01:46,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:01:46,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:01:46,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:01:46,521 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:01:46,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:01:46,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:01:46,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 14:01:46,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:01:46,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:01:46,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:46,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:01:46,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 14:01:46,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 14:01:46,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:01:46,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:01:46,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:01:46,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:01:46,525 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 -> 42be0dd7c0591debf7e5f003ab2565c2cee2d060ebc66ea41d5f9c8be093c1f8 [2021-12-21 14:01:46,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:01:46,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:01:46,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:01:46,782 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:01:46,783 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:01:46,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-019.c [2021-12-21 14:01:46,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e1115ad/1be530917d77492b938bc4e2424b5706/FLAGaa4fe23d8 [2021-12-21 14:01:47,313 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:01:47,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-019.c [2021-12-21 14:01:47,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e1115ad/1be530917d77492b938bc4e2424b5706/FLAGaa4fe23d8 [2021-12-21 14:01:47,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e1115ad/1be530917d77492b938bc4e2424b5706 [2021-12-21 14:01:47,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:01:47,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:01:47,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:47,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:01:47,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:01:47,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:01:47" (1/1) ... [2021-12-21 14:01:47,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce4f25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:47, skipping insertion in model container [2021-12-21 14:01:47,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:01:47" (1/1) ... [2021-12-21 14:01:47,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:01:47,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:01:47,959 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-019.c[13716,13729] [2021-12-21 14:01:47,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:47,974 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:01:48,078 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-019.c[13716,13729] [2021-12-21 14:01:48,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:48,093 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:01:48,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:48 WrapperNode [2021-12-21 14:01:48,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:48,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:48,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:01:48,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:01:48,110 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:48" (1/1) ... [2021-12-21 14:01:48,129 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:48" (1/1) ... [2021-12-21 14:01:48,186 INFO L137 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 397 [2021-12-21 14:01:48,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:48,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:01:48,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:01:48,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:01:48,195 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:48" (1/1) ... [2021-12-21 14:01:48,196 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:48" (1/1) ... [2021-12-21 14:01:48,201 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:48" (1/1) ... [2021-12-21 14:01:48,201 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:48" (1/1) ... [2021-12-21 14:01:48,218 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:48" (1/1) ... [2021-12-21 14:01:48,220 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:48" (1/1) ... [2021-12-21 14:01:48,223 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:48" (1/1) ... [2021-12-21 14:01:48,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:01:48,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:01:48,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:01:48,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:01:48,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:48" (1/1) ... [2021-12-21 14:01:48,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:01:48,281 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:48,298 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:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:01:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:01:48,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:01:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 14:01:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-21 14:01:48,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-21 14:01:48,438 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:01:48,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:01:48,746 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:01:48,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:01:48,755 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 14:01:48,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:01:48 BoogieIcfgContainer [2021-12-21 14:01:48,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:01:48,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:01:48,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:01:48,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:01:48,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:01:47" (1/3) ... [2021-12-21 14:01:48,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0b0caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:01:48, skipping insertion in model container [2021-12-21 14:01:48,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:01:48" (2/3) ... [2021-12-21 14:01:48,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0b0caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:01:48, skipping insertion in model container [2021-12-21 14:01:48,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:01:48" (3/3) ... [2021-12-21 14:01:48,765 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-019.c [2021-12-21 14:01:48,769 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:01:48,769 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 14:01:48,809 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:01:48,815 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:48,816 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 14:01:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 66 states have internal predecessors, (67), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2021-12-21 14:01:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2021-12-21 14:01:48,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:48,978 INFO L514 BasicCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash -122620394, now seen corresponding path program 1 times [2021-12-21 14:01:48,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:01:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211763964] [2021-12-21 14:01:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:49,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:01:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 14:01:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 14:01:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 14:01:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 14:01:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 14:01:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 14:01:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 14:01:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 14:01:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 14:01:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 14:01:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 14:01:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 14:01:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-21 14:01:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 14:01:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 14:01:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 14:01:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 14:01:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 14:01:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 14:01:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 14:01:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 14:01:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 14:01:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-21 14:01:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 14:01:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-21 14:01:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-21 14:01:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-21 14:01:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-21 14:01:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 14:01:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 14:01:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-21 14:01:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-21 14:01:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-21 14:01:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-21 14:01:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-21 14:01:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-21 14:01:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-21 14:01:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-21 14:01:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-21 14:01:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-21 14:01:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-21 14:01:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-21 14:01:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-12-21 14:01:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-21 14:01:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-21 14:01:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-21 14:01:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-21 14:01:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-21 14:01:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-21 14:01:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-21 14:01:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-21 14:01:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 14:01:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-21 14:01:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-21 14:01:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-21 14:01:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-21 14:01:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-21 14:01:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-21 14:01:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-21 14:01:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-21 14:01:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-21 14:01:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-21 14:01:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-21 14:01:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-21 14:01:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-21 14:01:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-21 14:01:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-21 14:01:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-21 14:01:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-21 14:01:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-12-21 14:01:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-21 14:01:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-12-21 14:01:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2021-12-21 14:01:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-21 14:01:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-12-21 14:01:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-21 14:01:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-12-21 14:01:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2021-12-21 14:01:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2021-12-21 14:01:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2021-12-21 14:01:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-12-21 14:01:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2021-12-21 14:01:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2021-12-21 14:01:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2021-12-21 14:01:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2021-12-21 14:01:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2021-12-21 14:01:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2021-12-21 14:01:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2021-12-21 14:01:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2021-12-21 14:01:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2021-12-21 14:01:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2021-12-21 14:01:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2021-12-21 14:01:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-12-21 14:01:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-12-21 14:01:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2021-12-21 14:01:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2021-12-21 14:01:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2021-12-21 14:01:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2021-12-21 14:01:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2021-12-21 14:01:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2021-12-21 14:01:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2021-12-21 14:01:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2021-12-21 14:01:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2021-12-21 14:01:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2021-12-21 14:01:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2021-12-21 14:01:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 579 [2021-12-21 14:01:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2021-12-21 14:01:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2021-12-21 14:01:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596 [2021-12-21 14:01:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2021-12-21 14:01:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2021-12-21 14:01:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2021-12-21 14:01:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2021-12-21 14:01:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2021-12-21 14:01:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2021-12-21 14:01:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2021-12-21 14:01:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 639 [2021-12-21 14:01:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 644 [2021-12-21 14:01:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 649 [2021-12-21 14:01:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2021-12-21 14:01:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 659 [2021-12-21 14:01:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2021-12-21 14:01:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2021-12-21 14:01:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 674 [2021-12-21 14:01:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 679 [2021-12-21 14:01:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 684 [2021-12-21 14:01:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 689 [2021-12-21 14:01:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 694 [2021-12-21 14:01:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2021-12-21 14:01:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2021-12-21 14:01:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2021-12-21 14:01:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 714 [2021-12-21 14:01:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 719 [2021-12-21 14:01:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 724 [2021-12-21 14:01:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 729 [2021-12-21 14:01:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2021-12-21 14:01:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2021-12-21 14:01:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 744 [2021-12-21 14:01:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 749 [2021-12-21 14:01:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2021-12-21 14:01:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 759 [2021-12-21 14:01:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2021-12-21 14:01:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 769 [2021-12-21 14:01:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 774 [2021-12-21 14:01:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779 [2021-12-21 14:01:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 784 [2021-12-21 14:01:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 789 [2021-12-21 14:01:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2021-12-21 14:01:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2021-12-21 14:01:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2021-12-21 14:01:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 809 [2021-12-21 14:01:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 814 [2021-12-21 14:01:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45904 trivial. 0 not checked. [2021-12-21 14:01:50,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:01:50,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211763964] [2021-12-21 14:01:50,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211763964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:01:50,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:01:50,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:01:50,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469998031] [2021-12-21 14:01:50,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:01:50,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 14:01:50,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:01:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 14:01:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:01:50,322 INFO L87 Difference]: Start difference. First operand has 220 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 66 states have internal predecessors, (67), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2021-12-21 14:01:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:01:50,411 INFO L93 Difference]: Finished difference Result 434 states and 888 transitions. [2021-12-21 14:01:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 14:01:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) Word has length 820 [2021-12-21 14:01:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:01:50,424 INFO L225 Difference]: With dead ends: 434 [2021-12-21 14:01:50,425 INFO L226 Difference]: Without dead ends: 217 [2021-12-21 14:01:50,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 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:50,436 INFO L933 BasicCegarLoop]: 367 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, 367 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:50,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 367 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:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-21 14:01:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-21 14:01:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2021-12-21 14:01:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 367 transitions. [2021-12-21 14:01:50,542 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 367 transitions. Word has length 820 [2021-12-21 14:01:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:01:50,543 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 367 transitions. [2021-12-21 14:01:50,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2021-12-21 14:01:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 367 transitions. [2021-12-21 14:01:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2021-12-21 14:01:50,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:50,575 INFO L514 BasicCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 14:01:50,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -763287658, now seen corresponding path program 1 times [2021-12-21 14:01:50,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:01:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283672674] [2021-12-21 14:01:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:50,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:01:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:01:50,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 14:01:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:01:51,308 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 14:01:51,309 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 14:01:51,310 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 14:01:51,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 14:01:51,315 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-21 14:01:51,318 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 14:01:51,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:01:51 BoogieIcfgContainer [2021-12-21 14:01:51,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 14:01:51,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 14:01:51,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 14:01:51,542 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 14:01:51,542 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:48" (3/4) ... [2021-12-21 14:01:51,545 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 14:01:51,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 14:01:51,546 INFO L158 Benchmark]: Toolchain (without parser) took 3870.44ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 79.5MB in the beginning and 94.8MB in the end (delta: -15.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,547 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:01:51,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.78ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 73.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.40ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 67.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,552 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 111.1MB. Free memory was 67.3MB in the beginning and 64.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,553 INFO L158 Benchmark]: RCFGBuilder took 528.16ms. Allocated memory is still 111.1MB. Free memory was 64.6MB in the beginning and 41.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,553 INFO L158 Benchmark]: TraceAbstraction took 2782.52ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 41.6MB in the beginning and 94.8MB in the end (delta: -53.2MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2021-12-21 14:01:51,553 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 148.9MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:01:51,558 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.19ms. Allocated memory is still 81.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.78ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 73.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.40ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 67.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 111.1MB. Free memory was 67.3MB in the beginning and 64.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.16ms. Allocated memory is still 111.1MB. Free memory was 64.6MB in the beginning and 41.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2782.52ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 41.6MB in the beginning and 94.8MB in the end (delta: -53.2MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 148.9MB. Free memory is still 94.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: 406]: 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 402. 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=0] [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=0] [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var1=0, var2=0, var3=0, var4=1] [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=0, var1=0, var2=0, var3=0, var4=1] [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=0, var1=0, var2=0, var3=0, var4=1, var5=0] [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=0, var1=0, var2=0, var3=0, var4=1, var5=0] [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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1] [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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1] [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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, 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=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L253] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L254-L257] CALL assume((var36 == 0 & var37 == 0 & var0 == 1) | (var36 == 0 & var37 == 1 & var0 == 0) | (var36 == 1 & var37 == 0 & var0 == 0) | (var36 == 1 & var37 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L254-L257] RET assume((var36 == 0 & var37 == 0 & var0 == 1) | (var36 == 0 & var37 == 1 & var0 == 0) | (var36 == 1 & var37 == 0 & var0 == 0) | (var36 == 1 & var37 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L258-L261] CALL assume((var1 == 0 & var39 == 0 & var2 == 1) | (var1 == 0 & var39 == 1 & var2 == 0) | (var1 == 1 & var39 == 0 & var2 == 0) | (var1 == 1 & var39 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=81, cond=81] [L258-L261] RET assume((var1 == 0 & var39 == 0 & var2 == 1) | (var1 == 0 & var39 == 1 & var2 == 0) | (var1 == 1 & var39 == 0 & var2 == 0) | (var1 == 1 & var39 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L262-L265] CALL assume((var2 == 0 & var40 == 0 & var3 == 1) | (var2 == 0 & var40 == 1 & var3 == 0) | (var2 == 1 & var40 == 0 & var3 == 0) | (var2 == 1 & var40 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L262-L265] RET assume((var2 == 0 & var40 == 0 & var3 == 1) | (var2 == 0 & var40 == 1 & var3 == 0) | (var2 == 1 & var40 == 0 & var3 == 0) | (var2 == 1 & var40 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L266-L269] CALL assume((var3 == 0 & var41 == 0 & var4 == 1) | (var3 == 0 & var41 == 1 & var4 == 0) | (var3 == 1 & var41 == 0 & var4 == 0) | (var3 == 1 & var41 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=85, cond=85] [L266-L269] RET assume((var3 == 0 & var41 == 0 & var4 == 1) | (var3 == 0 & var41 == 1 & var4 == 0) | (var3 == 1 & var41 == 0 & var4 == 0) | (var3 == 1 & var41 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L270-L273] CALL assume((var4 == 0 & var42 == 0 & var5 == 1) | (var4 == 0 & var42 == 1 & var5 == 0) | (var4 == 1 & var42 == 0 & var5 == 0) | (var4 == 1 & var42 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L270-L273] RET assume((var4 == 0 & var42 == 0 & var5 == 1) | (var4 == 0 & var42 == 1 & var5 == 0) | (var4 == 1 & var42 == 0 & var5 == 0) | (var4 == 1 & var42 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L274-L277] CALL assume((var5 == 0 & var43 == 0 & var6 == 1) | (var5 == 0 & var43 == 1 & var6 == 0) | (var5 == 1 & var43 == 0 & var6 == 0) | (var5 == 1 & var43 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L274-L277] RET assume((var5 == 0 & var43 == 0 & var6 == 1) | (var5 == 0 & var43 == 1 & var6 == 0) | (var5 == 1 & var43 == 0 & var6 == 0) | (var5 == 1 & var43 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L278-L281] CALL assume((var6 == 0 & var44 == 0 & var7 == 1) | (var6 == 0 & var44 == 1 & var7 == 0) | (var6 == 1 & var44 == 0 & var7 == 0) | (var6 == 1 & var44 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L278-L281] RET assume((var6 == 0 & var44 == 0 & var7 == 1) | (var6 == 0 & var44 == 1 & var7 == 0) | (var6 == 1 & var44 == 0 & var7 == 0) | (var6 == 1 & var44 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L282-L285] CALL assume((var7 == 0 & var45 == 0 & var8 == 1) | (var7 == 0 & var45 == 1 & var8 == 0) | (var7 == 1 & var45 == 0 & var8 == 0) | (var7 == 1 & var45 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L282-L285] RET assume((var7 == 0 & var45 == 0 & var8 == 1) | (var7 == 0 & var45 == 1 & var8 == 0) | (var7 == 1 & var45 == 0 & var8 == 0) | (var7 == 1 & var45 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L286-L289] CALL assume((var8 == 0 & var46 == 0 & var9 == 1) | (var8 == 0 & var46 == 1 & var9 == 0) | (var8 == 1 & var46 == 0 & var9 == 0) | (var8 == 1 & var46 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L286-L289] RET assume((var8 == 0 & var46 == 0 & var9 == 1) | (var8 == 0 & var46 == 1 & var9 == 0) | (var8 == 1 & var46 == 0 & var9 == 0) | (var8 == 1 & var46 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L290-L293] CALL assume((var9 == 0 & var47 == 0 & var10 == 1) | (var9 == 0 & var47 == 1 & var10 == 0) | (var9 == 1 & var47 == 0 & var10 == 0) | (var9 == 1 & var47 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=82, cond=82] [L290-L293] RET assume((var9 == 0 & var47 == 0 & var10 == 1) | (var9 == 0 & var47 == 1 & var10 == 0) | (var9 == 1 & var47 == 0 & var10 == 0) | (var9 == 1 & var47 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L294-L297] CALL assume((var10 == 0 & var48 == 0 & var11 == 1) | (var10 == 0 & var48 == 1 & var11 == 0) | (var10 == 1 & var48 == 0 & var11 == 0) | (var10 == 1 & var48 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L294-L297] RET assume((var10 == 0 & var48 == 0 & var11 == 1) | (var10 == 0 & var48 == 1 & var11 == 0) | (var10 == 1 & var48 == 0 & var11 == 0) | (var10 == 1 & var48 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L298-L301] CALL assume((var11 == 0 & var49 == 0 & var12 == 1) | (var11 == 0 & var49 == 1 & var12 == 0) | (var11 == 1 & var49 == 0 & var12 == 0) | (var11 == 1 & var49 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L298-L301] RET assume((var11 == 0 & var49 == 0 & var12 == 1) | (var11 == 0 & var49 == 1 & var12 == 0) | (var11 == 1 & var49 == 0 & var12 == 0) | (var11 == 1 & var49 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L302-L305] CALL assume((var12 == 0 & var50 == 0 & var13 == 1) | (var12 == 0 & var50 == 1 & var13 == 0) | (var12 == 1 & var50 == 0 & var13 == 0) | (var12 == 1 & var50 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L302-L305] RET assume((var12 == 0 & var50 == 0 & var13 == 1) | (var12 == 0 & var50 == 1 & var13 == 0) | (var12 == 1 & var50 == 0 & var13 == 0) | (var12 == 1 & var50 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L306-L309] CALL assume((var13 == 0 & var51 == 0 & var14 == 1) | (var13 == 0 & var51 == 1 & var14 == 0) | (var13 == 1 & var51 == 0 & var14 == 0) | (var13 == 1 & var51 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L306-L309] RET assume((var13 == 0 & var51 == 0 & var14 == 1) | (var13 == 0 & var51 == 1 & var14 == 0) | (var13 == 1 & var51 == 0 & var14 == 0) | (var13 == 1 & var51 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L310-L313] CALL assume((var14 == 0 & var52 == 0 & var15 == 1) | (var14 == 0 & var52 == 1 & var15 == 0) | (var14 == 1 & var52 == 0 & var15 == 0) | (var14 == 1 & var52 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L310-L313] RET assume((var14 == 0 & var52 == 0 & var15 == 1) | (var14 == 0 & var52 == 1 & var15 == 0) | (var14 == 1 & var52 == 0 & var15 == 0) | (var14 == 1 & var52 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L314-L317] CALL assume((var15 == 0 & var53 == 0 & var16 == 1) | (var15 == 0 & var53 == 1 & var16 == 0) | (var15 == 1 & var53 == 0 & var16 == 0) | (var15 == 1 & var53 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L314-L317] RET assume((var15 == 0 & var53 == 0 & var16 == 1) | (var15 == 0 & var53 == 1 & var16 == 0) | (var15 == 1 & var53 == 0 & var16 == 0) | (var15 == 1 & var53 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L318-L321] CALL assume((var16 == 0 & var54 == 0 & var17 == 1) | (var16 == 0 & var54 == 1 & var17 == 0) | (var16 == 1 & var54 == 0 & var17 == 0) | (var16 == 1 & var54 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=86, cond=86] [L318-L321] RET assume((var16 == 0 & var54 == 0 & var17 == 1) | (var16 == 0 & var54 == 1 & var17 == 0) | (var16 == 1 & var54 == 0 & var17 == 0) | (var16 == 1 & var54 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L322-L325] CALL assume((var0 == 0 & var38 == 0 & var1 == 1) | (var0 == 0 & var38 == 1 & var1 == 0) | (var0 == 1 & var38 == 0 & var1 == 0) | (var0 == 1 & var38 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L322-L325] RET assume((var0 == 0 & var38 == 0 & var1 == 1) | (var0 == 0 & var38 == 1 & var1 == 0) | (var0 == 1 & var38 == 0 & var1 == 0) | (var0 == 1 & var38 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L326-L329] CALL assume((var18 == 0 & var55 == 0 & var56 == 1) | (var18 == 0 & var55 == 1 & var56 == 0) | (var18 == 1 & var55 == 0 & var56 == 0) | (var18 == 1 & var55 == 1 & var56 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=79, cond=79] [L326-L329] RET assume((var18 == 0 & var55 == 0 & var56 == 1) | (var18 == 0 & var55 == 1 & var56 == 0) | (var18 == 1 & var55 == 0 & var56 == 0) | (var18 == 1 & var55 == 1 & var56 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L330-L333] CALL assume((var17 == 0 & var55 == 0 & var56 == 1) | (var17 == 0 & var55 == 1 & var56 == 0) | (var17 == 1 & var55 == 0 & var56 == 0) | (var17 == 1 & var55 == 1 & var56 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L330-L333] RET assume((var17 == 0 & var55 == 0 & var56 == 1) | (var17 == 0 & var55 == 1 & var56 == 0) | (var17 == 1 & var55 == 0 & var56 == 0) | (var17 == 1 & var55 == 1 & var56 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L334-L337] CALL assume((var20 == 0 & var53 == 0 & var19 == 1) | (var20 == 0 & var53 == 1 & var19 == 0) | (var20 == 1 & var53 == 0 & var19 == 0) | (var20 == 1 & var53 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L334-L337] RET assume((var20 == 0 & var53 == 0 & var19 == 1) | (var20 == 0 & var53 == 1 & var19 == 0) | (var20 == 1 & var53 == 0 & var19 == 0) | (var20 == 1 & var53 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L338-L341] CALL assume((var21 == 0 & var52 == 0 & var20 == 1) | (var21 == 0 & var52 == 1 & var20 == 0) | (var21 == 1 & var52 == 0 & var20 == 0) | (var21 == 1 & var52 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L338-L341] RET assume((var21 == 0 & var52 == 0 & var20 == 1) | (var21 == 0 & var52 == 1 & var20 == 0) | (var21 == 1 & var52 == 0 & var20 == 0) | (var21 == 1 & var52 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L342-L345] CALL assume((var22 == 0 & var51 == 0 & var21 == 1) | (var22 == 0 & var51 == 1 & var21 == 0) | (var22 == 1 & var51 == 0 & var21 == 0) | (var22 == 1 & var51 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L342-L345] RET assume((var22 == 0 & var51 == 0 & var21 == 1) | (var22 == 0 & var51 == 1 & var21 == 0) | (var22 == 1 & var51 == 0 & var21 == 0) | (var22 == 1 & var51 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L346-L349] CALL assume((var23 == 0 & var50 == 0 & var22 == 1) | (var23 == 0 & var50 == 1 & var22 == 0) | (var23 == 1 & var50 == 0 & var22 == 0) | (var23 == 1 & var50 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L346-L349] RET assume((var23 == 0 & var50 == 0 & var22 == 1) | (var23 == 0 & var50 == 1 & var22 == 0) | (var23 == 1 & var50 == 0 & var22 == 0) | (var23 == 1 & var50 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L350-L353] CALL assume((var24 == 0 & var49 == 0 & var23 == 1) | (var24 == 0 & var49 == 1 & var23 == 0) | (var24 == 1 & var49 == 0 & var23 == 0) | (var24 == 1 & var49 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=80, cond=80] [L350-L353] RET assume((var24 == 0 & var49 == 0 & var23 == 1) | (var24 == 0 & var49 == 1 & var23 == 0) | (var24 == 1 & var49 == 0 & var23 == 0) | (var24 == 1 & var49 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L354-L357] CALL assume((var25 == 0 & var48 == 0 & var24 == 1) | (var25 == 0 & var48 == 1 & var24 == 0) | (var25 == 1 & var48 == 0 & var24 == 0) | (var25 == 1 & var48 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L354-L357] RET assume((var25 == 0 & var48 == 0 & var24 == 1) | (var25 == 0 & var48 == 1 & var24 == 0) | (var25 == 1 & var48 == 0 & var24 == 0) | (var25 == 1 & var48 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L358-L361] CALL assume((var26 == 0 & var47 == 0 & var25 == 1) | (var26 == 0 & var47 == 1 & var25 == 0) | (var26 == 1 & var47 == 0 & var25 == 0) | (var26 == 1 & var47 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L358-L361] RET assume((var26 == 0 & var47 == 0 & var25 == 1) | (var26 == 0 & var47 == 1 & var25 == 0) | (var26 == 1 & var47 == 0 & var25 == 0) | (var26 == 1 & var47 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L362-L365] CALL assume((var27 == 0 & var46 == 0 & var26 == 1) | (var27 == 0 & var46 == 1 & var26 == 0) | (var27 == 1 & var46 == 0 & var26 == 0) | (var27 == 1 & var46 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L362-L365] RET assume((var27 == 0 & var46 == 0 & var26 == 1) | (var27 == 0 & var46 == 1 & var26 == 0) | (var27 == 1 & var46 == 0 & var26 == 0) | (var27 == 1 & var46 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L366-L369] CALL assume((var28 == 0 & var45 == 0 & var27 == 1) | (var28 == 0 & var45 == 1 & var27 == 0) | (var28 == 1 & var45 == 0 & var27 == 0) | (var28 == 1 & var45 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L366-L369] RET assume((var28 == 0 & var45 == 0 & var27 == 1) | (var28 == 0 & var45 == 1 & var27 == 0) | (var28 == 1 & var45 == 0 & var27 == 0) | (var28 == 1 & var45 == 1 & var27 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L370-L373] CALL assume((var29 == 0 & var44 == 0 & var28 == 1) | (var29 == 0 & var44 == 1 & var28 == 0) | (var29 == 1 & var44 == 0 & var28 == 0) | (var29 == 1 & var44 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L370-L373] RET assume((var29 == 0 & var44 == 0 & var28 == 1) | (var29 == 0 & var44 == 1 & var28 == 0) | (var29 == 1 & var44 == 0 & var28 == 0) | (var29 == 1 & var44 == 1 & var28 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L374-L377] CALL assume((var30 == 0 & var43 == 0 & var29 == 1) | (var30 == 0 & var43 == 1 & var29 == 0) | (var30 == 1 & var43 == 0 & var29 == 0) | (var30 == 1 & var43 == 1 & var29 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=84, cond=84] [L374-L377] RET assume((var30 == 0 & var43 == 0 & var29 == 1) | (var30 == 0 & var43 == 1 & var29 == 0) | (var30 == 1 & var43 == 0 & var29 == 0) | (var30 == 1 & var43 == 1 & var29 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L378-L381] CALL assume((var31 == 0 & var42 == 0 & var30 == 1) | (var31 == 0 & var42 == 1 & var30 == 0) | (var31 == 1 & var42 == 0 & var30 == 0) | (var31 == 1 & var42 == 1 & var30 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L378-L381] RET assume((var31 == 0 & var42 == 0 & var30 == 1) | (var31 == 0 & var42 == 1 & var30 == 0) | (var31 == 1 & var42 == 0 & var30 == 0) | (var31 == 1 & var42 == 1 & var30 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L382-L385] CALL assume((var32 == 0 & var41 == 0 & var31 == 1) | (var32 == 0 & var41 == 1 & var31 == 0) | (var32 == 1 & var41 == 0 & var31 == 0) | (var32 == 1 & var41 == 1 & var31 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L382-L385] RET assume((var32 == 0 & var41 == 0 & var31 == 1) | (var32 == 0 & var41 == 1 & var31 == 0) | (var32 == 1 & var41 == 0 & var31 == 0) | (var32 == 1 & var41 == 1 & var31 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L386-L389] CALL assume((var33 == 0 & var40 == 0 & var32 == 1) | (var33 == 0 & var40 == 1 & var32 == 0) | (var33 == 1 & var40 == 0 & var32 == 0) | (var33 == 1 & var40 == 1 & var32 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L386-L389] RET assume((var33 == 0 & var40 == 0 & var32 == 1) | (var33 == 0 & var40 == 1 & var32 == 0) | (var33 == 1 & var40 == 0 & var32 == 0) | (var33 == 1 & var40 == 1 & var32 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L390-L393] CALL assume((var34 == 0 & var39 == 0 & var33 == 1) | (var34 == 0 & var39 == 1 & var33 == 0) | (var34 == 1 & var39 == 0 & var33 == 0) | (var34 == 1 & var39 == 1 & var33 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L390-L393] RET assume((var34 == 0 & var39 == 0 & var33 == 1) | (var34 == 0 & var39 == 1 & var33 == 0) | (var34 == 1 & var39 == 0 & var33 == 0) | (var34 == 1 & var39 == 1 & var33 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L394-L397] CALL assume((var35 == 0 & var38 == 0 & var34 == 1) | (var35 == 0 & var38 == 1 & var34 == 0) | (var35 == 1 & var38 == 0 & var34 == 0) | (var35 == 1 & var38 == 1 & var34 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L394-L397] RET assume((var35 == 0 & var38 == 0 & var34 == 1) | (var35 == 0 & var38 == 1 & var34 == 0) | (var35 == 1 & var38 == 0 & var34 == 0) | (var35 == 1 & var38 == 1 & var34 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L398-L401] CALL assume((var19 == 0 & var54 == 0 & var18 == 1) | (var19 == 0 & var54 == 1 & var18 == 0) | (var19 == 1 & var54 == 0 & var18 == 0) | (var19 == 1 & var54 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=83, cond=83] [L398-L401] RET assume((var19 == 0 & var54 == 0 & var18 == 1) | (var19 == 0 & var54 == 1 & var18 == 0) | (var19 == 1 & var54 == 0 & var18 == 0) | (var19 == 1 & var54 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L402-L405] CALL assume((var36 == 0 & var37 == 0 & var35 == 0) | (var36 == 0 & var37 == 1 & var35 == 1) | (var36 == 1 & var37 == 0 & var35 == 1) | (var36 == 1 & var37 == 1 & var35 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L402-L405] RET assume((var36 == 0 & var37 == 0 & var35 == 0) | (var36 == 0 & var37 == 1 & var35 == 1) | (var36 == 1 & var37 == 0 & var35 == 1) | (var36 == 1 & var37 == 1 & var35 == 0) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] [L406] reach_error() VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=1, var12=0, var13=1, var14=0, var15=0, var16=0, var17=1, var18=0, var19=0, var2=0, var20=1, var21=0, var22=1, var23=1, var24=0, var25=1, var26=1, var27=0, var28=1, var29=1, var3=0, var30=1, var31=1, var32=1, var33=0, var34=0, var35=0, var36=0, var37=1, var38=0, var39=0, var4=1, var40=0, var41=1, var42=0, var43=1, var44=1, var45=1, var46=0, var47=0, var48=0, var49=0, var5=0, var50=0, var51=1, var52=1, var53=1, var54=1, var55=0, var56=1, var6=1, var7=1, var8=0, var9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 220 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 2, TraceHistogramMax: 152, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.2s, 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, 367 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, 367 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred 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.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 45904/45904 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:51,620 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-019.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 42be0dd7c0591debf7e5f003ab2565c2cee2d060ebc66ea41d5f9c8be093c1f8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:01:53,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:01:53,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:01:53,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:01:53,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:01:53,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:01:53,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:01:53,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:01:53,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:01:53,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:01:53,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:01:53,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:01:53,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:01:53,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:01:53,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:01:53,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:01:53,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:01:53,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:01:53,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:01:53,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:01:53,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:01:53,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:01:53,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:01:53,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:01:53,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:01:53,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:01:53,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:01:53,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:01:53,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:01:53,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:01:53,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:01:53,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:01:53,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:01:53,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:01:53,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:01:53,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:01:53,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:01:53,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:01:53,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:01:53,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:01:53,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:01:53,659 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:01:53,679 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:01:53,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:01:53,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:01:53,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:01:53,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:01:53,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:01:53,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:01:53,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:01:53,682 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:01:53,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:01:53,683 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:01:53,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:01:53,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:01:53,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:01:53,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:01:53,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:01:53,684 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 14:01:53,684 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 14:01:53,684 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 14:01:53,684 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:01:53,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:01:53,685 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:01:53,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:01:53,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:01:53,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:01:53,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:01:53,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:53,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:01:53,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:01:53,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:01:53,686 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:01:53,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 14:01:53,688 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 -> 42be0dd7c0591debf7e5f003ab2565c2cee2d060ebc66ea41d5f9c8be093c1f8 [2021-12-21 14:01:54,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:01:54,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:01:54,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:01:54,068 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:01:54,069 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:01:54,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-019.c [2021-12-21 14:01:54,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1b15ad/7d6e7592f6ca407e9d00e8f688616028/FLAG5c6f1604b [2021-12-21 14:01:54,664 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:01:54,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-019.c [2021-12-21 14:01:54,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1b15ad/7d6e7592f6ca407e9d00e8f688616028/FLAG5c6f1604b [2021-12-21 14:01:55,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1b15ad/7d6e7592f6ca407e9d00e8f688616028 [2021-12-21 14:01:55,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:01:55,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:01:55,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:55,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:01:55,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:01:55,033 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,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a89cf1 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,035 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,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:01:55,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:01:55,331 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-019.c[13716,13729] [2021-12-21 14:01:55,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:55,392 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:01:55,471 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-019.c[13716,13729] [2021-12-21 14:01:55,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:01:55,499 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:01:55,500 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,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:01:55,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:55,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:01:55,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:01:55,506 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,520 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,566 INFO L137 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 340 [2021-12-21 14:01:55,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:01:55,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:01:55,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:01:55,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:01:55,574 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,574 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,579 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,580 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,593 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,609 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,611 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,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:01:55,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:01:55,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:01:55,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:01:55,618 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,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:01:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:01:55,657 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,681 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,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:01:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:01:55,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:01:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 14:01:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-21 14:01:55,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-21 14:01:55,822 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:01:55,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:01:56,213 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:01:56,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:01:56,223 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 14:01:56,225 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,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:01:56,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:01:56,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:01:56,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:01:56,230 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,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1277fc8b 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,231 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,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1277fc8b 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,231 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,232 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-019.c [2021-12-21 14:01:56,237 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:01:56,237 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 14:01:56,293 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:01:56,299 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,299 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 14:01:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 66 states have internal predecessors, (67), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2021-12-21 14:01:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2021-12-21 14:01:56,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:56,387 INFO L514 BasicCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash -122620394, now seen corresponding path program 1 times [2021-12-21 14:01:56,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 14:01:56,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473420030] [2021-12-21 14:01:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:56,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 14:01:56,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 14:01:56,419 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:01:56,458 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:01:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:01:56,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-21 14:01:56,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:01:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 22478 proven. 0 refuted. 0 times theorem prover too weak. 23426 trivial. 0 not checked. [2021-12-21 14:01:58,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 14:01:58,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 14:01:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473420030] [2021-12-21 14:01:58,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473420030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:01:58,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:01:58,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:01:58,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109658542] [2021-12-21 14:01:58,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:01:58,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 14:01:58,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 14:01:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 14:01:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 14:01:58,222 INFO L87 Difference]: Start difference. First operand has 220 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 66 states have internal predecessors, (67), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 2 states have call predecessors, (152), 2 states have call successors, (152) [2021-12-21 14:01:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:01:58,309 INFO L93 Difference]: Finished difference Result 434 states and 888 transitions. [2021-12-21 14:01:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 14:01:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 2 states have call predecessors, (152), 2 states have call successors, (152) Word has length 820 [2021-12-21 14:01:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:01:58,325 INFO L225 Difference]: With dead ends: 434 [2021-12-21 14:01:58,325 INFO L226 Difference]: Without dead ends: 217 [2021-12-21 14:01:58,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 819 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:58,338 INFO L933 BasicCegarLoop]: 367 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, 367 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:58,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 367 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:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-21 14:01:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-21 14:01:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2021-12-21 14:01:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 367 transitions. [2021-12-21 14:01:58,447 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 367 transitions. Word has length 820 [2021-12-21 14:01:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:01:58,448 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 367 transitions. [2021-12-21 14:01:58,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 2 states have call predecessors, (152), 2 states have call successors, (152) [2021-12-21 14:01:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 367 transitions. [2021-12-21 14:01:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2021-12-21 14:01:58,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:01:58,470 INFO L514 BasicCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-21 14:01:58,688 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:01:58,689 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:01:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:01:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -763287658, now seen corresponding path program 1 times [2021-12-21 14:01:58,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 14:01:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235705182] [2021-12-21 14:01:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:01:58,691 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 14:01:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 14:01:58,695 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:01:58,696 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:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:02:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 306 conjunts are in the unsatisfiable core [2021-12-21 14:02:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates...