./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c4445a855f1d8b7e9ddfbfb035e8a8180cf6b12 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:01:09,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:01:09,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:01:09,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:01:09,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:01:09,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:01:09,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:01:09,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:01:09,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:01:09,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:01:09,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:01:09,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:01:09,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:01:09,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:01:09,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:01:09,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:01:09,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:01:09,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:01:09,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:01:09,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:01:09,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:01:09,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:01:09,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:01:09,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:01:09,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:01:09,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:01:09,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:01:09,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:01:09,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:01:09,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:01:09,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:01:09,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:01:09,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:01:09,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:01:09,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:01:09,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:01:09,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:01:09,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:01:09,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:01:09,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:01:09,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:01:09,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:01:09,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:01:09,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:01:09,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:01:09,413 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:01:09,413 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:01:09,414 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:01:09,414 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:01:09,415 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:01:09,415 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:01:09,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:01:09,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:01:09,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:01:09,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:01:09,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:01:09,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:01:09,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:01:09,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:01:09,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:01:09,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:01:09,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:01:09,418 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 9c4445a855f1d8b7e9ddfbfb035e8a8180cf6b12 [2019-12-07 11:01:09,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:01:09,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:01:09,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:01:09,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:01:09,531 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:01:09,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe034_power.opt.i [2019-12-07 11:01:09,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/data/a586170c8/d88f52915ef14e239fb7f6f14de55a24/FLAG68fb3f053 [2019-12-07 11:01:09,999 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:01:09,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/sv-benchmarks/c/pthread-wmm/safe034_power.opt.i [2019-12-07 11:01:10,009 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/data/a586170c8/d88f52915ef14e239fb7f6f14de55a24/FLAG68fb3f053 [2019-12-07 11:01:10,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/data/a586170c8/d88f52915ef14e239fb7f6f14de55a24 [2019-12-07 11:01:10,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:01:10,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:01:10,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:10,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:01:10,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:01:10,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10, skipping insertion in model container [2019-12-07 11:01:10,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:01:10,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:01:10,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:10,696 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:01:10,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:10,786 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:01:10,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10 WrapperNode [2019-12-07 11:01:10,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:10,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:10,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:01:10,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:01:10,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:10,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:01:10,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:01:10,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:01:10,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... [2019-12-07 11:01:10,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:01:10,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:01:10,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:01:10,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:01:10,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:01:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:01:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:01:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:01:10,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:01:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:01:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:01:10,890 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:01:11,208 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:01:11,208 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:01:11,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:11 BoogieIcfgContainer [2019-12-07 11:01:11,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:01:11,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:01:11,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:01:11,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:01:11,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:01:10" (1/3) ... [2019-12-07 11:01:11,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a497af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:11, skipping insertion in model container [2019-12-07 11:01:11,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:10" (2/3) ... [2019-12-07 11:01:11,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a497af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:11, skipping insertion in model container [2019-12-07 11:01:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:11" (3/3) ... [2019-12-07 11:01:11,214 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.opt.i [2019-12-07 11:01:11,220 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:01:11,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:01:11,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:01:11,225 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:11,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:01:11,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:01:11,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:01:11,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:01:11,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:01:11,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:01:11,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:01:11,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:01:11,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:01:11,297 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 11:01:11,298 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:01:11,344 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:01:11,344 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:11,352 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:01:11,364 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:01:11,387 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:01:11,387 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:11,390 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:01:11,399 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 11:01:11,400 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:01:13,901 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 11:01:14,104 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-07 11:01:14,104 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 11:01:14,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-07 11:01:14,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-07 11:01:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-07 11:01:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:01:14,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:14,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:14,798 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-07 11:01:14,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:14,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890529873] [2019-12-07 11:01:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:14,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890529873] [2019-12-07 11:01:14,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:14,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:01:14,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861973519] [2019-12-07 11:01:14,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:14,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:14,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:14,974 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-07 11:01:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:15,167 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-07 11:01:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:15,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:01:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:15,266 INFO L225 Difference]: With dead ends: 13722 [2019-12-07 11:01:15,266 INFO L226 Difference]: Without dead ends: 12214 [2019-12-07 11:01:15,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-07 11:01:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-07 11:01:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-07 11:01:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-07 11:01:15,738 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-07 11:01:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:15,739 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-07 11:01:15,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-07 11:01:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:01:15,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:15,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:15,743 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-07 11:01:15,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:15,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818163746] [2019-12-07 11:01:15,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:15,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818163746] [2019-12-07 11:01:15,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:15,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:15,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826823171] [2019-12-07 11:01:15,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:15,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:15,808 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-07 11:01:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:16,063 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-07 11:01:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:16,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:01:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:16,130 INFO L225 Difference]: With dead ends: 18446 [2019-12-07 11:01:16,130 INFO L226 Difference]: Without dead ends: 18390 [2019-12-07 11:01:16,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-07 11:01:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-07 11:01:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-07 11:01:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-07 11:01:16,595 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-07 11:01:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:16,595 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-07 11:01:16,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-07 11:01:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:01:16,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:16,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:16,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-07 11:01:16,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:16,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095705649] [2019-12-07 11:01:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:16,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095705649] [2019-12-07 11:01:16,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:16,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:16,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938664183] [2019-12-07 11:01:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:01:16,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:01:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:16,660 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-07 11:01:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:16,878 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-07 11:01:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:01:16,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:01:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:16,954 INFO L225 Difference]: With dead ends: 24000 [2019-12-07 11:01:16,954 INFO L226 Difference]: Without dead ends: 23924 [2019-12-07 11:01:16,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:01:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-07 11:01:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-07 11:01:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-07 11:01:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-07 11:01:17,399 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-07 11:01:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:17,399 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-07 11:01:17,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:01:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-07 11:01:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:01:17,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:17,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:17,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-07 11:01:17,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:17,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099930150] [2019-12-07 11:01:17,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:17,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099930150] [2019-12-07 11:01:17,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:17,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:17,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885116747] [2019-12-07 11:01:17,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:17,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:17,472 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-07 11:01:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:17,545 INFO L93 Difference]: Finished difference Result 19280 states and 70741 transitions. [2019-12-07 11:01:17,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:17,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:01:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:17,578 INFO L225 Difference]: With dead ends: 19280 [2019-12-07 11:01:17,578 INFO L226 Difference]: Without dead ends: 19280 [2019-12-07 11:01:17,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-12-07 11:01:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19016. [2019-12-07 11:01:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-12-07 11:01:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 69841 transitions. [2019-12-07 11:01:17,928 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 69841 transitions. Word has length 18 [2019-12-07 11:01:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:17,928 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 69841 transitions. [2019-12-07 11:01:17,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 69841 transitions. [2019-12-07 11:01:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:01:17,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:17,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:17,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2086322840, now seen corresponding path program 1 times [2019-12-07 11:01:17,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:17,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709374638] [2019-12-07 11:01:17,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:17,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709374638] [2019-12-07 11:01:17,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:17,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:01:17,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577820959] [2019-12-07 11:01:17,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:17,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:17,986 INFO L87 Difference]: Start difference. First operand 19016 states and 69841 transitions. Second operand 3 states. [2019-12-07 11:01:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:18,102 INFO L93 Difference]: Finished difference Result 26927 states and 94091 transitions. [2019-12-07 11:01:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:18,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:01:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:18,211 INFO L225 Difference]: With dead ends: 26927 [2019-12-07 11:01:18,211 INFO L226 Difference]: Without dead ends: 26295 [2019-12-07 11:01:18,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26295 states. [2019-12-07 11:01:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26295 to 25562. [2019-12-07 11:01:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2019-12-07 11:01:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 90430 transitions. [2019-12-07 11:01:18,651 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 90430 transitions. Word has length 18 [2019-12-07 11:01:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:18,652 INFO L462 AbstractCegarLoop]: Abstraction has 25562 states and 90430 transitions. [2019-12-07 11:01:18,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 90430 transitions. [2019-12-07 11:01:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:01:18,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:18,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:18,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:18,658 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-07 11:01:18,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:18,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490334177] [2019-12-07 11:01:18,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:18,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490334177] [2019-12-07 11:01:18,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:18,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:01:18,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967413072] [2019-12-07 11:01:18,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:01:18,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:01:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:18,714 INFO L87 Difference]: Start difference. First operand 25562 states and 90430 transitions. Second operand 5 states. [2019-12-07 11:01:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:18,761 INFO L93 Difference]: Finished difference Result 4382 states and 12860 transitions. [2019-12-07 11:01:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:18,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 11:01:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:18,764 INFO L225 Difference]: With dead ends: 4382 [2019-12-07 11:01:18,764 INFO L226 Difference]: Without dead ends: 2858 [2019-12-07 11:01:18,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:01:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-12-07 11:01:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2019-12-07 11:01:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-12-07 11:01:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 7333 transitions. [2019-12-07 11:01:18,790 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 7333 transitions. Word has length 19 [2019-12-07 11:01:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:18,790 INFO L462 AbstractCegarLoop]: Abstraction has 2858 states and 7333 transitions. [2019-12-07 11:01:18,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:01:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 7333 transitions. [2019-12-07 11:01:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:01:18,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:18,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:18,793 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-07 11:01:18,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:18,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168855307] [2019-12-07 11:01:18,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:18,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168855307] [2019-12-07 11:01:18,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147186070] [2019-12-07 11:01:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:18,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:18,818 INFO L87 Difference]: Start difference. First operand 2858 states and 7333 transitions. Second operand 3 states. [2019-12-07 11:01:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:18,853 INFO L93 Difference]: Finished difference Result 3915 states and 9708 transitions. [2019-12-07 11:01:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:18,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:01:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:18,858 INFO L225 Difference]: With dead ends: 3915 [2019-12-07 11:01:18,858 INFO L226 Difference]: Without dead ends: 3915 [2019-12-07 11:01:18,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2019-12-07 11:01:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3005. [2019-12-07 11:01:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-12-07 11:01:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7535 transitions. [2019-12-07 11:01:18,890 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7535 transitions. Word has length 29 [2019-12-07 11:01:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 7535 transitions. [2019-12-07 11:01:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7535 transitions. [2019-12-07 11:01:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:01:18,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:18,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:18,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:18,893 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-07 11:01:18,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:18,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671391590] [2019-12-07 11:01:18,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:18,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671391590] [2019-12-07 11:01:18,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:18,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:01:18,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286950624] [2019-12-07 11:01:18,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:01:18,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:01:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:01:18,958 INFO L87 Difference]: Start difference. First operand 3005 states and 7535 transitions. Second operand 6 states. [2019-12-07 11:01:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:19,178 INFO L93 Difference]: Finished difference Result 4482 states and 10963 transitions. [2019-12-07 11:01:19,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:01:19,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 11:01:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:19,182 INFO L225 Difference]: With dead ends: 4482 [2019-12-07 11:01:19,182 INFO L226 Difference]: Without dead ends: 4474 [2019-12-07 11:01:19,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:01:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2019-12-07 11:01:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 3100. [2019-12-07 11:01:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-12-07 11:01:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 7742 transitions. [2019-12-07 11:01:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 7742 transitions. Word has length 29 [2019-12-07 11:01:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:19,251 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 7742 transitions. [2019-12-07 11:01:19,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:01:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 7742 transitions. [2019-12-07 11:01:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:01:19,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:19,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:19,255 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:19,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 1 times [2019-12-07 11:01:19,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:19,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882736728] [2019-12-07 11:01:19,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:19,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882736728] [2019-12-07 11:01:19,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:19,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:01:19,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170595718] [2019-12-07 11:01:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:01:19,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:01:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:01:19,312 INFO L87 Difference]: Start difference. First operand 3100 states and 7742 transitions. Second operand 6 states. [2019-12-07 11:01:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:19,359 INFO L93 Difference]: Finished difference Result 1877 states and 4852 transitions. [2019-12-07 11:01:19,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:01:19,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 11:01:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:19,361 INFO L225 Difference]: With dead ends: 1877 [2019-12-07 11:01:19,361 INFO L226 Difference]: Without dead ends: 1747 [2019-12-07 11:01:19,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:01:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-12-07 11:01:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1256. [2019-12-07 11:01:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-12-07 11:01:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3372 transitions. [2019-12-07 11:01:19,375 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3372 transitions. Word has length 30 [2019-12-07 11:01:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:19,376 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3372 transitions. [2019-12-07 11:01:19,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:01:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3372 transitions. [2019-12-07 11:01:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:01:19,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:19,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:19,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-12-07 11:01:19,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:19,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188554694] [2019-12-07 11:01:19,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:19,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188554694] [2019-12-07 11:01:19,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:19,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:19,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594479759] [2019-12-07 11:01:19,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:19,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:19,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:19,402 INFO L87 Difference]: Start difference. First operand 1256 states and 3372 transitions. Second operand 3 states. [2019-12-07 11:01:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:19,426 INFO L93 Difference]: Finished difference Result 1456 states and 3760 transitions. [2019-12-07 11:01:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:19,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 11:01:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:19,428 INFO L225 Difference]: With dead ends: 1456 [2019-12-07 11:01:19,428 INFO L226 Difference]: Without dead ends: 1456 [2019-12-07 11:01:19,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-12-07 11:01:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1308. [2019-12-07 11:01:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-12-07 11:01:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 3424 transitions. [2019-12-07 11:01:19,441 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 3424 transitions. Word has length 45 [2019-12-07 11:01:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:19,441 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 3424 transitions. [2019-12-07 11:01:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 3424 transitions. [2019-12-07 11:01:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:01:19,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:19,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:19,443 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-12-07 11:01:19,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:19,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877469999] [2019-12-07 11:01:19,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:19,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877469999] [2019-12-07 11:01:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268311450] [2019-12-07 11:01:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:19,499 INFO L87 Difference]: Start difference. First operand 1308 states and 3424 transitions. Second operand 4 states. [2019-12-07 11:01:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:19,513 INFO L93 Difference]: Finished difference Result 1845 states and 4579 transitions. [2019-12-07 11:01:19,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:01:19,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 11:01:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:19,514 INFO L225 Difference]: With dead ends: 1845 [2019-12-07 11:01:19,514 INFO L226 Difference]: Without dead ends: 1192 [2019-12-07 11:01:19,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-07 11:01:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-07 11:01:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-07 11:01:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-07 11:01:19,525 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-07 11:01:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:19,525 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-07 11:01:19,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-07 11:01:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:01:19,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:19,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:19,527 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 2 times [2019-12-07 11:01:19,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:19,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563173119] [2019-12-07 11:01:19,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:19,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563173119] [2019-12-07 11:01:19,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:19,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:01:19,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102179618] [2019-12-07 11:01:19,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:01:19,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:01:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:01:19,578 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-07 11:01:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:19,721 INFO L93 Difference]: Finished difference Result 3208 states and 8220 transitions. [2019-12-07 11:01:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:01:19,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 11:01:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:19,723 INFO L225 Difference]: With dead ends: 3208 [2019-12-07 11:01:19,723 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 11:01:19,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:01:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 11:01:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1336. [2019-12-07 11:01:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-07 11:01:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3428 transitions. [2019-12-07 11:01:19,737 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3428 transitions. Word has length 45 [2019-12-07 11:01:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:19,737 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3428 transitions. [2019-12-07 11:01:19,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:01:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3428 transitions. [2019-12-07 11:01:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:01:19,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:19,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:19,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 3 times [2019-12-07 11:01:19,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:19,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252948901] [2019-12-07 11:01:19,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:19,806 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:01:19,806 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:01:19,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31| 1)) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31|) |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31|)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2580~0.base_31| 4)) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2580~0.base_31|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2580~0.base=|v_ULTIMATE.start_main_~#t2580~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2580~0.offset=|v_ULTIMATE.start_main_~#t2580~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2582~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t2581~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2580~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2580~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2582~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:01:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2581~0.base_10|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10|) |v_ULTIMATE.start_main_~#t2581~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2581~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2581~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_9|, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2581~0.offset, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2582~0.base_11| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2582~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2582~0.base_11| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2582~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11|) |v_ULTIMATE.start_main_~#t2582~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2582~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2582~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:01:19,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:01:19,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In59360642 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out59360642| ~y$w_buff0~0_In59360642) (= |P1Thread1of1ForFork1_#t~ite8_In59360642| |P1Thread1of1ForFork1_#t~ite8_Out59360642|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out59360642| |P1Thread1of1ForFork1_#t~ite8_Out59360642|) (= |P1Thread1of1ForFork1_#t~ite8_Out59360642| ~y$w_buff0~0_In59360642) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In59360642 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In59360642 256) 0)) (= (mod ~y$w_buff0_used~0_In59360642 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In59360642 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$w_buff0~0=~y$w_buff0~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In59360642|, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out59360642|, ~y$w_buff0~0=~y$w_buff0~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out59360642|, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:01:19,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-158895307 256) 0))) (or (and (= ~y$w_buff0_used~0_In-158895307 |P1Thread1of1ForFork1_#t~ite15_Out-158895307|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-158895307| |P1Thread1of1ForFork1_#t~ite14_Out-158895307|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-158895307 256)))) (or (= (mod ~y$w_buff0_used~0_In-158895307 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-158895307 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-158895307 256)) .cse1))) (= ~y$w_buff0_used~0_In-158895307 |P1Thread1of1ForFork1_#t~ite14_Out-158895307|) (= |P1Thread1of1ForFork1_#t~ite14_Out-158895307| |P1Thread1of1ForFork1_#t~ite15_Out-158895307|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-158895307, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, ~weak$$choice2~0=~weak$$choice2~0_In-158895307, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-158895307|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158895307} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-158895307, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-158895307|, ~weak$$choice2~0=~weak$$choice2~0_In-158895307, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-158895307|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158895307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:01:19,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:01:19,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In859970586 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In859970586 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out859970586| ~y$w_buff0_used~0_In859970586)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out859970586|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In859970586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In859970586, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out859970586|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:01:19,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:01:19,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1034823554 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1034823554 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1034823554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1034823554 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1034823554 |P2Thread1of1ForFork2_#t~ite29_Out-1034823554|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1034823554|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1034823554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1034823554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034823554} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1034823554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1034823554, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1034823554|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034823554} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1875636712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1875636712 256))) (.cse2 (= ~y$r_buff0_thd3~0_In1875636712 ~y$r_buff0_thd3~0_Out1875636712))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1875636712)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1875636712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1875636712|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1875636712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In514000142 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In514000142 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In514000142 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In514000142 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out514000142| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out514000142| ~y$r_buff1_thd3~0_In514000142) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In514000142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In514000142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In514000142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514000142} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In514000142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In514000142, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out514000142|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In514000142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514000142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1300068937 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1300068937 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1300068937 |ULTIMATE.start_main_#t~ite35_Out1300068937|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1300068937| ~y$w_buff1~0_In1300068937)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1300068937, ~y~0=~y~0_In1300068937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1300068937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300068937} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1300068937, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1300068937|, ~y~0=~y~0_In1300068937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1300068937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300068937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:01:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1493365786 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1493365786 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out1493365786| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1493365786 |ULTIMATE.start_main_#t~ite37_Out1493365786|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1493365786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493365786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1493365786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493365786, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1493365786|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:01:19,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-639006710 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-639006710 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-639006710 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-639006710 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-639006710 |ULTIMATE.start_main_#t~ite38_Out-639006710|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-639006710|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-639006710|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:01:19,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In317779288 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In317779288 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out317779288|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In317779288 |ULTIMATE.start_main_#t~ite39_Out317779288|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In317779288, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In317779288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In317779288, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out317779288|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In317779288} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:01:19,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-962350810 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-962350810 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-962350810 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out-962350810| ~y$r_buff1_thd0~0_In-962350810)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-962350810| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-962350810|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:01:19,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:19,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:01:19 BasicIcfg [2019-12-07 11:01:19,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:01:19,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:01:19,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:01:19,864 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:01:19,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:11" (3/4) ... [2019-12-07 11:01:19,865 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:01:19,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31| 1)) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31|) |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31|)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2580~0.base_31| 4)) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2580~0.base_31|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2580~0.base=|v_ULTIMATE.start_main_~#t2580~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2580~0.offset=|v_ULTIMATE.start_main_~#t2580~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2582~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t2581~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2580~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2580~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2582~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:01:19,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2581~0.base_10|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10|) |v_ULTIMATE.start_main_~#t2581~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2581~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2581~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_9|, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2581~0.offset, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:19,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2582~0.base_11| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2582~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2582~0.base_11| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2582~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11|) |v_ULTIMATE.start_main_~#t2582~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2582~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2582~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:19,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:01:19,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:01:19,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In59360642 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out59360642| ~y$w_buff0~0_In59360642) (= |P1Thread1of1ForFork1_#t~ite8_In59360642| |P1Thread1of1ForFork1_#t~ite8_Out59360642|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out59360642| |P1Thread1of1ForFork1_#t~ite8_Out59360642|) (= |P1Thread1of1ForFork1_#t~ite8_Out59360642| ~y$w_buff0~0_In59360642) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In59360642 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In59360642 256) 0)) (= (mod ~y$w_buff0_used~0_In59360642 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In59360642 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$w_buff0~0=~y$w_buff0~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In59360642|, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out59360642|, ~y$w_buff0~0=~y$w_buff0~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out59360642|, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:01:19,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-158895307 256) 0))) (or (and (= ~y$w_buff0_used~0_In-158895307 |P1Thread1of1ForFork1_#t~ite15_Out-158895307|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-158895307| |P1Thread1of1ForFork1_#t~ite14_Out-158895307|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-158895307 256)))) (or (= (mod ~y$w_buff0_used~0_In-158895307 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-158895307 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-158895307 256)) .cse1))) (= ~y$w_buff0_used~0_In-158895307 |P1Thread1of1ForFork1_#t~ite14_Out-158895307|) (= |P1Thread1of1ForFork1_#t~ite14_Out-158895307| |P1Thread1of1ForFork1_#t~ite15_Out-158895307|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-158895307, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, ~weak$$choice2~0=~weak$$choice2~0_In-158895307, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-158895307|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158895307} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-158895307, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-158895307|, ~weak$$choice2~0=~weak$$choice2~0_In-158895307, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-158895307|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158895307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:01:19,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:01:19,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In859970586 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In859970586 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out859970586| ~y$w_buff0_used~0_In859970586)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out859970586|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In859970586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In859970586, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out859970586|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:01:19,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:01:19,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1034823554 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1034823554 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1034823554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1034823554 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1034823554 |P2Thread1of1ForFork2_#t~ite29_Out-1034823554|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1034823554|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1034823554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1034823554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034823554} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1034823554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1034823554, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1034823554|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034823554} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:01:19,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1875636712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1875636712 256))) (.cse2 (= ~y$r_buff0_thd3~0_In1875636712 ~y$r_buff0_thd3~0_Out1875636712))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1875636712)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1875636712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1875636712|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1875636712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In514000142 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In514000142 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In514000142 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In514000142 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out514000142| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out514000142| ~y$r_buff1_thd3~0_In514000142) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In514000142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In514000142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In514000142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514000142} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In514000142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In514000142, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out514000142|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In514000142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514000142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1300068937 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1300068937 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1300068937 |ULTIMATE.start_main_#t~ite35_Out1300068937|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1300068937| ~y$w_buff1~0_In1300068937)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1300068937, ~y~0=~y~0_In1300068937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1300068937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300068937} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1300068937, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1300068937|, ~y~0=~y~0_In1300068937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1300068937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300068937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:01:19,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1493365786 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1493365786 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out1493365786| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1493365786 |ULTIMATE.start_main_#t~ite37_Out1493365786|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1493365786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493365786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1493365786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1493365786, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1493365786|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:01:19,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-639006710 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-639006710 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-639006710 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-639006710 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-639006710 |ULTIMATE.start_main_#t~ite38_Out-639006710|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-639006710|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-639006710|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:01:19,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In317779288 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In317779288 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out317779288|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In317779288 |ULTIMATE.start_main_#t~ite39_Out317779288|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In317779288, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In317779288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In317779288, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out317779288|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In317779288} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:01:19,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-962350810 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-962350810 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-962350810 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out-962350810| ~y$r_buff1_thd0~0_In-962350810)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-962350810| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-962350810|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:01:19,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:19,923 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4b446ac0-62e0-441c-9554-e4bb2e10dc01/bin/utaipan/witness.graphml [2019-12-07 11:01:19,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:01:19,925 INFO L168 Benchmark]: Toolchain (without parser) took 9569.29 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 750.8 MB). Free memory was 942.5 MB in the beginning and 1.3 GB in the end (delta: -358.9 MB). Peak memory consumption was 391.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,925 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:19,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,926 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:19,926 INFO L168 Benchmark]: RCFGBuilder took 361.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,926 INFO L168 Benchmark]: TraceAbstraction took 8653.36 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 616.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -270.0 MB). Peak memory consumption was 346.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,927 INFO L168 Benchmark]: Witness Printer took 60.15 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:19,928 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 361.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8653.36 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 616.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -270.0 MB). Peak memory consumption was 346.6 MB. Max. memory is 11.5 GB. * Witness Printer took 60.15 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2580, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2581, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2582, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 1673 SDslu, 2326 SDs, 0 SdLazy, 825 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25562occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 10036 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 37612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...