./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_pso.oepc.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_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/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 ecaaf2d0226b2c68e6adc16c076be39404c7a86b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:48:36,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:48:36,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:48:36,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:48:36,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:48:36,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:48:36,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:48:36,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:48:36,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:48:36,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:48:36,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:48:36,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:48:36,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:48:36,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:48:36,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:48:36,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:48:36,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:48:36,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:48:36,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:48:36,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:48:36,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:48:36,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:48:36,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:48:36,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:48:36,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:48:36,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:48:36,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:48:36,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:48:36,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:48:36,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:48:36,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:48:36,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:48:36,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:48:36,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:48:36,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:48:36,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:48:36,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:48:36,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:48:36,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:48:36,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:48:36,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:48:36,869 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:48:36,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:48:36,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:48:36,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:48:36,882 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:48:36,882 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:48:36,882 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:48:36,882 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:48:36,883 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:48:36,883 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:48:36,884 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:48:36,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:48:36,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:48:36,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:48:36,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:48:36,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:48:36,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:48:36,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:48:36,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:48:36,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:48:36,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:48:36,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:48:36,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:48:36,887 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_1892cfaf-dade-4f9d-a11e-34f25f025bc6/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 -> ecaaf2d0226b2c68e6adc16c076be39404c7a86b [2019-12-07 13:48:36,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:48:37,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:48:37,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:48:37,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:48:37,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:48:37,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe008_pso.oepc.i [2019-12-07 13:48:37,042 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/data/c1412a9bc/bea88e9381934fc08fef7f3e9f62eedb/FLAG51988df40 [2019-12-07 13:48:37,484 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:48:37,484 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/sv-benchmarks/c/pthread-wmm/safe008_pso.oepc.i [2019-12-07 13:48:37,494 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/data/c1412a9bc/bea88e9381934fc08fef7f3e9f62eedb/FLAG51988df40 [2019-12-07 13:48:37,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/data/c1412a9bc/bea88e9381934fc08fef7f3e9f62eedb [2019-12-07 13:48:37,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:48:37,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:48:37,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:48:37,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:48:37,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:48:37,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37, skipping insertion in model container [2019-12-07 13:48:37,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:48:37,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:48:37,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:48:37,808 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:48:37,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:48:37,896 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:48:37,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37 WrapperNode [2019-12-07 13:48:37,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:48:37,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:48:37,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:48:37,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:48:37,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:48:37,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:48:37,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:48:37,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:48:37,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... [2019-12-07 13:48:37,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:48:37,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:48:37,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:48:37,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:48:37,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/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 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:48:38,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:48:38,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:48:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:48:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:48:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:48:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:48:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:48:38,006 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 13:48:38,366 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:48:38,366 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:48:38,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:48:38 BoogieIcfgContainer [2019-12-07 13:48:38,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:48:38,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:48:38,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:48:38,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:48:38,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:48:37" (1/3) ... [2019-12-07 13:48:38,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2201e44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:48:38, skipping insertion in model container [2019-12-07 13:48:38,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:48:37" (2/3) ... [2019-12-07 13:48:38,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2201e44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:48:38, skipping insertion in model container [2019-12-07 13:48:38,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:48:38" (3/3) ... [2019-12-07 13:48:38,374 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-07 13:48:38,380 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:48:38,380 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:48:38,385 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:48:38,386 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:48:38,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:48:38,448 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:48:38,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:48:38,449 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:48:38,449 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:48:38,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:48:38,449 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:48:38,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:48:38,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:48:38,461 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 13:48:38,462 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 13:48:38,527 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 13:48:38,527 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:48:38,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 585 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:48:38,552 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 13:48:38,588 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 13:48:38,588 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:48:38,594 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 585 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:48:38,610 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-07 13:48:38,611 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:48:41,364 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 13:48:41,450 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-07 13:48:41,450 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 13:48:41,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-07 13:48:56,410 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-07 13:48:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-07 13:48:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:48:56,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:48:56,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:48:56,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:48:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:48:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-07 13:48:56,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:48:56,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805070736] [2019-12-07 13:48:56,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:48:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:48:56,553 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 13:48:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805070736] [2019-12-07 13:48:56,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:48:56,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:48:56,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951698685] [2019-12-07 13:48:56,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:48:56,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:48:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:48:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:48:56,568 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-07 13:48:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:48:57,338 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-07 13:48:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:48:57,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:48:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:48:57,930 INFO L225 Difference]: With dead ends: 115182 [2019-12-07 13:48:57,930 INFO L226 Difference]: Without dead ends: 112830 [2019-12-07 13:48:57,931 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 13:49:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-07 13:49:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-07 13:49:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-07 13:49:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-07 13:49:04,671 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-07 13:49:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:04,671 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-07 13:49:04,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:49:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-07 13:49:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:49:04,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:04,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:04,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:49:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-07 13:49:04,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:04,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562732026] [2019-12-07 13:49:04,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:04,747 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 13:49:04,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562732026] [2019-12-07 13:49:04,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:04,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:49:04,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334281069] [2019-12-07 13:49:04,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:49:04,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:49:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:49:04,749 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-07 13:49:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:05,728 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-07 13:49:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:05,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:49:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:06,592 INFO L225 Difference]: With dead ends: 176302 [2019-12-07 13:49:06,592 INFO L226 Difference]: Without dead ends: 176253 [2019-12-07 13:49:06,593 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 13:49:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-07 13:49:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-07 13:49:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-07 13:49:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-07 13:49:15,329 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-07 13:49:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:15,329 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-07 13:49:15,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:49:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-07 13:49:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:49:15,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:15,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:15,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:49:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-07 13:49:15,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:15,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072768293] [2019-12-07 13:49:15,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:15,391 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 13:49:15,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072768293] [2019-12-07 13:49:15,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:15,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:49:15,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302216274] [2019-12-07 13:49:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:49:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:49:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:49:15,393 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-07 13:49:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:16,579 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-07 13:49:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:16,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:49:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:17,666 INFO L225 Difference]: With dead ends: 228428 [2019-12-07 13:49:17,667 INFO L226 Difference]: Without dead ends: 228365 [2019-12-07 13:49:17,667 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 13:49:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-07 13:49:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-07 13:49:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-07 13:49:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-07 13:49:28,038 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-07 13:49:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:28,039 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-07 13:49:28,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:49:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-07 13:49:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:49:28,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:28,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:28,042 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:49:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-07 13:49:28,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:28,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968497138] [2019-12-07 13:49:28,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:28,090 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 13:49:28,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968497138] [2019-12-07 13:49:28,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:28,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:49:28,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220810660] [2019-12-07 13:49:28,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:49:28,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:49:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:49:28,092 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 4 states. [2019-12-07 13:49:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:29,834 INFO L93 Difference]: Finished difference Result 240534 states and 988069 transitions. [2019-12-07 13:49:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:29,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:49:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:30,421 INFO L225 Difference]: With dead ends: 240534 [2019-12-07 13:49:30,421 INFO L226 Difference]: Without dead ends: 240534 [2019-12-07 13:49:30,421 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 13:49:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240534 states. [2019-12-07 13:49:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240534 to 203638. [2019-12-07 13:49:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203638 states. [2019-12-07 13:49:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203638 states to 203638 states and 844577 transitions. [2019-12-07 13:49:41,780 INFO L78 Accepts]: Start accepts. Automaton has 203638 states and 844577 transitions. Word has length 13 [2019-12-07 13:49:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:41,780 INFO L462 AbstractCegarLoop]: Abstraction has 203638 states and 844577 transitions. [2019-12-07 13:49:41,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:49:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 203638 states and 844577 transitions. [2019-12-07 13:49:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:49:41,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:41,805 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 13:49:41,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:49:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1303088540, now seen corresponding path program 1 times [2019-12-07 13:49:41,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:41,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243220479] [2019-12-07 13:49:41,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:41,850 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 13:49:41,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243220479] [2019-12-07 13:49:41,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:41,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:49:41,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223101461] [2019-12-07 13:49:41,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:49:41,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:49:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:49:41,851 INFO L87 Difference]: Start difference. First operand 203638 states and 844577 transitions. Second operand 5 states. [2019-12-07 13:49:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:43,992 INFO L93 Difference]: Finished difference Result 300567 states and 1220027 transitions. [2019-12-07 13:49:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:49:43,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:49:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:44,745 INFO L225 Difference]: With dead ends: 300567 [2019-12-07 13:49:44,746 INFO L226 Difference]: Without dead ends: 300504 [2019-12-07 13:49:44,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:49:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300504 states. [2019-12-07 13:49:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300504 to 216214. [2019-12-07 13:49:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216214 states. [2019-12-07 13:49:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216214 states to 216214 states and 891891 transitions. [2019-12-07 13:49:54,787 INFO L78 Accepts]: Start accepts. Automaton has 216214 states and 891891 transitions. Word has length 19 [2019-12-07 13:49:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:54,787 INFO L462 AbstractCegarLoop]: Abstraction has 216214 states and 891891 transitions. [2019-12-07 13:49:54,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:49:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 216214 states and 891891 transitions. [2019-12-07 13:49:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:49:54,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:54,800 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 13:49:54,800 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:49:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-07 13:49:54,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:54,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609757054] [2019-12-07 13:49:54,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:54,856 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 13:49:54,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609757054] [2019-12-07 13:49:54,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:54,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:49:54,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363903502] [2019-12-07 13:49:54,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:49:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:49:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:49:54,858 INFO L87 Difference]: Start difference. First operand 216214 states and 891891 transitions. Second operand 5 states. [2019-12-07 13:49:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:56,994 INFO L93 Difference]: Finished difference Result 326371 states and 1320375 transitions. [2019-12-07 13:49:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:49:56,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:49:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:57,812 INFO L225 Difference]: With dead ends: 326371 [2019-12-07 13:49:57,812 INFO L226 Difference]: Without dead ends: 326224 [2019-12-07 13:49:57,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:50:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326224 states. [2019-12-07 13:50:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326224 to 227768. [2019-12-07 13:50:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227768 states. [2019-12-07 13:50:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227768 states to 227768 states and 938858 transitions. [2019-12-07 13:50:11,264 INFO L78 Accepts]: Start accepts. Automaton has 227768 states and 938858 transitions. Word has length 19 [2019-12-07 13:50:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:11,264 INFO L462 AbstractCegarLoop]: Abstraction has 227768 states and 938858 transitions. [2019-12-07 13:50:11,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 227768 states and 938858 transitions. [2019-12-07 13:50:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:50:11,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:11,280 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 13:50:11,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 550593021, now seen corresponding path program 1 times [2019-12-07 13:50:11,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:11,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757297717] [2019-12-07 13:50:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:11,319 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 13:50:11,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757297717] [2019-12-07 13:50:11,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685141259] [2019-12-07 13:50:11,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:11,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:11,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:11,320 INFO L87 Difference]: Start difference. First operand 227768 states and 938858 transitions. Second operand 5 states. [2019-12-07 13:50:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:13,360 INFO L93 Difference]: Finished difference Result 330156 states and 1338658 transitions. [2019-12-07 13:50:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:50:13,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:50:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:14,215 INFO L225 Difference]: With dead ends: 330156 [2019-12-07 13:50:14,216 INFO L226 Difference]: Without dead ends: 330093 [2019-12-07 13:50:14,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:50:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330093 states. [2019-12-07 13:50:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330093 to 245714. [2019-12-07 13:50:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245714 states. [2019-12-07 13:50:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245714 states to 245714 states and 1011495 transitions. [2019-12-07 13:50:25,541 INFO L78 Accepts]: Start accepts. Automaton has 245714 states and 1011495 transitions. Word has length 19 [2019-12-07 13:50:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:25,541 INFO L462 AbstractCegarLoop]: Abstraction has 245714 states and 1011495 transitions. [2019-12-07 13:50:25,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 245714 states and 1011495 transitions. [2019-12-07 13:50:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:50:25,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:25,607 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] [2019-12-07 13:50:25,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash 956366417, now seen corresponding path program 1 times [2019-12-07 13:50:25,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:25,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056347631] [2019-12-07 13:50:25,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:25,690 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 13:50:25,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056347631] [2019-12-07 13:50:25,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:25,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:25,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621174968] [2019-12-07 13:50:25,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:25,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:25,692 INFO L87 Difference]: Start difference. First operand 245714 states and 1011495 transitions. Second operand 6 states. [2019-12-07 13:50:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:27,988 INFO L93 Difference]: Finished difference Result 293437 states and 1194200 transitions. [2019-12-07 13:50:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:50:27,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 13:50:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:28,732 INFO L225 Difference]: With dead ends: 293437 [2019-12-07 13:50:28,733 INFO L226 Difference]: Without dead ends: 293290 [2019-12-07 13:50:28,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:50:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293290 states. [2019-12-07 13:50:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293290 to 203000. [2019-12-07 13:50:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203000 states. [2019-12-07 13:50:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203000 states to 203000 states and 839373 transitions. [2019-12-07 13:50:41,357 INFO L78 Accepts]: Start accepts. Automaton has 203000 states and 839373 transitions. Word has length 25 [2019-12-07 13:50:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:41,358 INFO L462 AbstractCegarLoop]: Abstraction has 203000 states and 839373 transitions. [2019-12-07 13:50:41,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 203000 states and 839373 transitions. [2019-12-07 13:50:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:50:41,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:41,433 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] [2019-12-07 13:50:41,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -826573092, now seen corresponding path program 1 times [2019-12-07 13:50:41,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:41,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655423286] [2019-12-07 13:50:41,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:41,461 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 13:50:41,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655423286] [2019-12-07 13:50:41,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:41,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:41,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782218480] [2019-12-07 13:50:41,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:41,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:41,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:41,462 INFO L87 Difference]: Start difference. First operand 203000 states and 839373 transitions. Second operand 3 states. [2019-12-07 13:50:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:41,579 INFO L93 Difference]: Finished difference Result 41735 states and 134919 transitions. [2019-12-07 13:50:41,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:41,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 13:50:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:41,634 INFO L225 Difference]: With dead ends: 41735 [2019-12-07 13:50:41,635 INFO L226 Difference]: Without dead ends: 41735 [2019-12-07 13:50:41,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:50:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41735 states. [2019-12-07 13:50:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41735 to 41735. [2019-12-07 13:50:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41735 states. [2019-12-07 13:50:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41735 states to 41735 states and 134919 transitions. [2019-12-07 13:50:42,616 INFO L78 Accepts]: Start accepts. Automaton has 41735 states and 134919 transitions. Word has length 27 [2019-12-07 13:50:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:42,617 INFO L462 AbstractCegarLoop]: Abstraction has 41735 states and 134919 transitions. [2019-12-07 13:50:42,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41735 states and 134919 transitions. [2019-12-07 13:50:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:50:42,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:42,637 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] [2019-12-07 13:50:42,637 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash -181038669, now seen corresponding path program 1 times [2019-12-07 13:50:42,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:42,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185318241] [2019-12-07 13:50:42,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:42,680 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 13:50:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185318241] [2019-12-07 13:50:42,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:42,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835920202] [2019-12-07 13:50:42,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:42,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:42,681 INFO L87 Difference]: Start difference. First operand 41735 states and 134919 transitions. Second operand 4 states. [2019-12-07 13:50:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:42,706 INFO L93 Difference]: Finished difference Result 7949 states and 21432 transitions. [2019-12-07 13:50:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:50:42,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 13:50:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:42,713 INFO L225 Difference]: With dead ends: 7949 [2019-12-07 13:50:42,713 INFO L226 Difference]: Without dead ends: 7949 [2019-12-07 13:50:42,713 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 13:50:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2019-12-07 13:50:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7837. [2019-12-07 13:50:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7837 states. [2019-12-07 13:50:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7837 states to 7837 states and 21112 transitions. [2019-12-07 13:50:42,800 INFO L78 Accepts]: Start accepts. Automaton has 7837 states and 21112 transitions. Word has length 39 [2019-12-07 13:50:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:42,800 INFO L462 AbstractCegarLoop]: Abstraction has 7837 states and 21112 transitions. [2019-12-07 13:50:42,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7837 states and 21112 transitions. [2019-12-07 13:50:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:50:42,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:42,806 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:42,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -118101162, now seen corresponding path program 1 times [2019-12-07 13:50:42,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:42,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987644603] [2019-12-07 13:50:42,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:42,845 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 13:50:42,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987644603] [2019-12-07 13:50:42,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:42,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:42,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659951747] [2019-12-07 13:50:42,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:42,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:42,846 INFO L87 Difference]: Start difference. First operand 7837 states and 21112 transitions. Second operand 5 states. [2019-12-07 13:50:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:42,872 INFO L93 Difference]: Finished difference Result 5331 states and 15289 transitions. [2019-12-07 13:50:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:50:42,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 13:50:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:42,877 INFO L225 Difference]: With dead ends: 5331 [2019-12-07 13:50:42,877 INFO L226 Difference]: Without dead ends: 5331 [2019-12-07 13:50:42,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2019-12-07 13:50:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 4967. [2019-12-07 13:50:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4967 states. [2019-12-07 13:50:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 14305 transitions. [2019-12-07 13:50:42,937 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 14305 transitions. Word has length 51 [2019-12-07 13:50:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:42,937 INFO L462 AbstractCegarLoop]: Abstraction has 4967 states and 14305 transitions. [2019-12-07 13:50:42,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 14305 transitions. [2019-12-07 13:50:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:50:42,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:42,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:42,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-07 13:50:42,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:42,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538779189] [2019-12-07 13:50:42,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:42,996 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 13:50:42,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538779189] [2019-12-07 13:50:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:50:42,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296106785] [2019-12-07 13:50:42,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:42,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:42,998 INFO L87 Difference]: Start difference. First operand 4967 states and 14305 transitions. Second operand 5 states. [2019-12-07 13:50:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:43,180 INFO L93 Difference]: Finished difference Result 7558 states and 21570 transitions. [2019-12-07 13:50:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:50:43,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 13:50:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:43,186 INFO L225 Difference]: With dead ends: 7558 [2019-12-07 13:50:43,187 INFO L226 Difference]: Without dead ends: 7558 [2019-12-07 13:50:43,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-07 13:50:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6659. [2019-12-07 13:50:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6659 states. [2019-12-07 13:50:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 19091 transitions. [2019-12-07 13:50:43,271 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 19091 transitions. Word has length 65 [2019-12-07 13:50:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:43,271 INFO L462 AbstractCegarLoop]: Abstraction has 6659 states and 19091 transitions. [2019-12-07 13:50:43,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 19091 transitions. [2019-12-07 13:50:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:50:43,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:43,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:43,277 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-07 13:50:43,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:43,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192278450] [2019-12-07 13:50:43,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:43,351 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 13:50:43,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192278450] [2019-12-07 13:50:43,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:43,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:43,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9743971] [2019-12-07 13:50:43,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:43,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:43,352 INFO L87 Difference]: Start difference. First operand 6659 states and 19091 transitions. Second operand 3 states. [2019-12-07 13:50:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:43,375 INFO L93 Difference]: Finished difference Result 6289 states and 17750 transitions. [2019-12-07 13:50:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:43,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 13:50:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:43,381 INFO L225 Difference]: With dead ends: 6289 [2019-12-07 13:50:43,381 INFO L226 Difference]: Without dead ends: 6289 [2019-12-07 13:50:43,381 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 13:50:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2019-12-07 13:50:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 6133. [2019-12-07 13:50:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6133 states. [2019-12-07 13:50:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6133 states to 6133 states and 17320 transitions. [2019-12-07 13:50:43,456 INFO L78 Accepts]: Start accepts. Automaton has 6133 states and 17320 transitions. Word has length 65 [2019-12-07 13:50:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:43,456 INFO L462 AbstractCegarLoop]: Abstraction has 6133 states and 17320 transitions. [2019-12-07 13:50:43,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 17320 transitions. [2019-12-07 13:50:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:43,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:43,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:43,460 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-07 13:50:43,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:43,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928339638] [2019-12-07 13:50:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:43,524 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 13:50:43,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928339638] [2019-12-07 13:50:43,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:43,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:50:43,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679904218] [2019-12-07 13:50:43,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:43,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:43,526 INFO L87 Difference]: Start difference. First operand 6133 states and 17320 transitions. Second operand 5 states. [2019-12-07 13:50:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:43,715 INFO L93 Difference]: Finished difference Result 8712 states and 24399 transitions. [2019-12-07 13:50:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:50:43,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:50:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:43,722 INFO L225 Difference]: With dead ends: 8712 [2019-12-07 13:50:43,723 INFO L226 Difference]: Without dead ends: 8712 [2019-12-07 13:50:43,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2019-12-07 13:50:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 6784. [2019-12-07 13:50:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6784 states. [2019-12-07 13:50:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6784 states to 6784 states and 19209 transitions. [2019-12-07 13:50:43,809 INFO L78 Accepts]: Start accepts. Automaton has 6784 states and 19209 transitions. Word has length 66 [2019-12-07 13:50:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:43,809 INFO L462 AbstractCegarLoop]: Abstraction has 6784 states and 19209 transitions. [2019-12-07 13:50:43,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6784 states and 19209 transitions. [2019-12-07 13:50:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:43,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:43,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:43,814 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-07 13:50:43,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:43,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341036315] [2019-12-07 13:50:43,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:44,006 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 13:50:44,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341036315] [2019-12-07 13:50:44,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:44,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:44,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611877150] [2019-12-07 13:50:44,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:50:44,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:50:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:50:44,007 INFO L87 Difference]: Start difference. First operand 6784 states and 19209 transitions. Second operand 13 states. [2019-12-07 13:50:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:44,460 INFO L93 Difference]: Finished difference Result 15281 states and 43257 transitions. [2019-12-07 13:50:44,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:50:44,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 13:50:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:44,467 INFO L225 Difference]: With dead ends: 15281 [2019-12-07 13:50:44,467 INFO L226 Difference]: Without dead ends: 7828 [2019-12-07 13:50:44,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:50:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7828 states. [2019-12-07 13:50:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7828 to 6415. [2019-12-07 13:50:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6415 states. [2019-12-07 13:50:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6415 states to 6415 states and 18105 transitions. [2019-12-07 13:50:44,551 INFO L78 Accepts]: Start accepts. Automaton has 6415 states and 18105 transitions. Word has length 66 [2019-12-07 13:50:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:44,552 INFO L462 AbstractCegarLoop]: Abstraction has 6415 states and 18105 transitions. [2019-12-07 13:50:44,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:50:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6415 states and 18105 transitions. [2019-12-07 13:50:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:44,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:44,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:44,556 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash -806353662, now seen corresponding path program 3 times [2019-12-07 13:50:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:44,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316762909] [2019-12-07 13:50:44,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:44,629 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 13:50:44,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316762909] [2019-12-07 13:50:44,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:44,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:50:44,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251811509] [2019-12-07 13:50:44,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:44,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:44,631 INFO L87 Difference]: Start difference. First operand 6415 states and 18105 transitions. Second operand 6 states. [2019-12-07 13:50:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:44,940 INFO L93 Difference]: Finished difference Result 9213 states and 25620 transitions. [2019-12-07 13:50:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:50:44,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-07 13:50:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:44,948 INFO L225 Difference]: With dead ends: 9213 [2019-12-07 13:50:44,948 INFO L226 Difference]: Without dead ends: 9213 [2019-12-07 13:50:44,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:50:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9213 states. [2019-12-07 13:50:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9213 to 6830. [2019-12-07 13:50:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6830 states. [2019-12-07 13:50:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 19261 transitions. [2019-12-07 13:50:45,042 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 19261 transitions. Word has length 66 [2019-12-07 13:50:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:45,042 INFO L462 AbstractCegarLoop]: Abstraction has 6830 states and 19261 transitions. [2019-12-07 13:50:45,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 19261 transitions. [2019-12-07 13:50:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:45,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:45,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:45,047 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1549059410, now seen corresponding path program 4 times [2019-12-07 13:50:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87159740] [2019-12-07 13:50:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:45,395 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 13:50:45,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87159740] [2019-12-07 13:50:45,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:45,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:50:45,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485484113] [2019-12-07 13:50:45,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:50:45,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:50:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:50:45,396 INFO L87 Difference]: Start difference. First operand 6830 states and 19261 transitions. Second operand 9 states. [2019-12-07 13:50:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:45,846 INFO L93 Difference]: Finished difference Result 11724 states and 32586 transitions. [2019-12-07 13:50:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:50:45,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-07 13:50:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:45,855 INFO L225 Difference]: With dead ends: 11724 [2019-12-07 13:50:45,855 INFO L226 Difference]: Without dead ends: 11724 [2019-12-07 13:50:45,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:50:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11724 states. [2019-12-07 13:50:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11724 to 7479. [2019-12-07 13:50:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7479 states. [2019-12-07 13:50:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 21056 transitions. [2019-12-07 13:50:45,966 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 21056 transitions. Word has length 66 [2019-12-07 13:50:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:45,966 INFO L462 AbstractCegarLoop]: Abstraction has 7479 states and 21056 transitions. [2019-12-07 13:50:45,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:50:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 21056 transitions. [2019-12-07 13:50:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:45,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:45,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:45,972 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash 479477378, now seen corresponding path program 5 times [2019-12-07 13:50:45,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:45,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337971334] [2019-12-07 13:50:45,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:46,100 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 13:50:46,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337971334] [2019-12-07 13:50:46,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:46,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:46,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701253495] [2019-12-07 13:50:46,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:50:46,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:46,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:50:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:46,101 INFO L87 Difference]: Start difference. First operand 7479 states and 21056 transitions. Second operand 11 states. [2019-12-07 13:50:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:46,989 INFO L93 Difference]: Finished difference Result 12163 states and 33776 transitions. [2019-12-07 13:50:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:50:46,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 13:50:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:47,000 INFO L225 Difference]: With dead ends: 12163 [2019-12-07 13:50:47,000 INFO L226 Difference]: Without dead ends: 12163 [2019-12-07 13:50:47,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:50:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2019-12-07 13:50:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 8091. [2019-12-07 13:50:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2019-12-07 13:50:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 22798 transitions. [2019-12-07 13:50:47,118 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 22798 transitions. Word has length 66 [2019-12-07 13:50:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:47,118 INFO L462 AbstractCegarLoop]: Abstraction has 8091 states and 22798 transitions. [2019-12-07 13:50:47,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:50:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 22798 transitions. [2019-12-07 13:50:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:47,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:47,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:47,124 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1795321204, now seen corresponding path program 6 times [2019-12-07 13:50:47,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:47,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210906970] [2019-12-07 13:50:47,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:47,247 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 13:50:47,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210906970] [2019-12-07 13:50:47,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:47,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241118175] [2019-12-07 13:50:47,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:50:47,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:50:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:47,248 INFO L87 Difference]: Start difference. First operand 8091 states and 22798 transitions. Second operand 11 states. [2019-12-07 13:50:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:48,119 INFO L93 Difference]: Finished difference Result 12207 states and 33965 transitions. [2019-12-07 13:50:48,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 13:50:48,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 13:50:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:48,130 INFO L225 Difference]: With dead ends: 12207 [2019-12-07 13:50:48,130 INFO L226 Difference]: Without dead ends: 12207 [2019-12-07 13:50:48,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:50:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2019-12-07 13:50:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 7521. [2019-12-07 13:50:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7521 states. [2019-12-07 13:50:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7521 states to 7521 states and 21207 transitions. [2019-12-07 13:50:48,241 INFO L78 Accepts]: Start accepts. Automaton has 7521 states and 21207 transitions. Word has length 66 [2019-12-07 13:50:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:48,241 INFO L462 AbstractCegarLoop]: Abstraction has 7521 states and 21207 transitions. [2019-12-07 13:50:48,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:50:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7521 states and 21207 transitions. [2019-12-07 13:50:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:48,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:48,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:48,246 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2091502336, now seen corresponding path program 7 times [2019-12-07 13:50:48,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:48,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410388734] [2019-12-07 13:50:48,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:48,327 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 13:50:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410388734] [2019-12-07 13:50:48,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:48,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:50:48,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856593188] [2019-12-07 13:50:48,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:50:48,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:50:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:50:48,329 INFO L87 Difference]: Start difference. First operand 7521 states and 21207 transitions. Second operand 9 states. [2019-12-07 13:50:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:48,978 INFO L93 Difference]: Finished difference Result 12432 states and 34845 transitions. [2019-12-07 13:50:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:50:48,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-07 13:50:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:48,990 INFO L225 Difference]: With dead ends: 12432 [2019-12-07 13:50:48,990 INFO L226 Difference]: Without dead ends: 12432 [2019-12-07 13:50:48,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:50:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12432 states. [2019-12-07 13:50:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12432 to 7731. [2019-12-07 13:50:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7731 states. [2019-12-07 13:50:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7731 states to 7731 states and 21807 transitions. [2019-12-07 13:50:49,113 INFO L78 Accepts]: Start accepts. Automaton has 7731 states and 21807 transitions. Word has length 66 [2019-12-07 13:50:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:49,113 INFO L462 AbstractCegarLoop]: Abstraction has 7731 states and 21807 transitions. [2019-12-07 13:50:49,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:50:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7731 states and 21807 transitions. [2019-12-07 13:50:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:50:49,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:49,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:49,119 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:49,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1951217226, now seen corresponding path program 8 times [2019-12-07 13:50:49,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:49,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255293701] [2019-12-07 13:50:49,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:49,153 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 13:50:49,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255293701] [2019-12-07 13:50:49,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:49,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:49,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679857518] [2019-12-07 13:50:49,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:49,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:49,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:49,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:49,154 INFO L87 Difference]: Start difference. First operand 7731 states and 21807 transitions. Second operand 3 states. [2019-12-07 13:50:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:49,191 INFO L93 Difference]: Finished difference Result 7730 states and 21805 transitions. [2019-12-07 13:50:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:49,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:50:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:49,198 INFO L225 Difference]: With dead ends: 7730 [2019-12-07 13:50:49,198 INFO L226 Difference]: Without dead ends: 7730 [2019-12-07 13:50:49,198 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 13:50:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2019-12-07 13:50:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 5129. [2019-12-07 13:50:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5129 states. [2019-12-07 13:50:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 14540 transitions. [2019-12-07 13:50:49,273 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 14540 transitions. Word has length 66 [2019-12-07 13:50:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:49,273 INFO L462 AbstractCegarLoop]: Abstraction has 5129 states and 14540 transitions. [2019-12-07 13:50:49,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 14540 transitions. [2019-12-07 13:50:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:50:49,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:49,277 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, 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 13:50:49,277 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:49,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1374418208, now seen corresponding path program 1 times [2019-12-07 13:50:49,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:49,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489587429] [2019-12-07 13:50:49,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:49,317 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 13:50:49,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489587429] [2019-12-07 13:50:49,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:49,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:49,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082808035] [2019-12-07 13:50:49,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:49,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:49,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:49,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:49,318 INFO L87 Difference]: Start difference. First operand 5129 states and 14540 transitions. Second operand 3 states. [2019-12-07 13:50:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:49,334 INFO L93 Difference]: Finished difference Result 4739 states and 13191 transitions. [2019-12-07 13:50:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:49,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 13:50:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:49,338 INFO L225 Difference]: With dead ends: 4739 [2019-12-07 13:50:49,338 INFO L226 Difference]: Without dead ends: 4739 [2019-12-07 13:50:49,338 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 13:50:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2019-12-07 13:50:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4174. [2019-12-07 13:50:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-07 13:50:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 11624 transitions. [2019-12-07 13:50:49,390 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 11624 transitions. Word has length 67 [2019-12-07 13:50:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:49,390 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 11624 transitions. [2019-12-07 13:50:49,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 11624 transitions. [2019-12-07 13:50:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:50:49,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:49,393 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, 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 13:50:49,393 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-07 13:50:49,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:49,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365953159] [2019-12-07 13:50:49,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:49,541 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 13:50:49,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365953159] [2019-12-07 13:50:49,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:49,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:49,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396902272] [2019-12-07 13:50:49,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:50:49,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:50:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:50:49,543 INFO L87 Difference]: Start difference. First operand 4174 states and 11624 transitions. Second operand 13 states. [2019-12-07 13:50:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:49,917 INFO L93 Difference]: Finished difference Result 7214 states and 20004 transitions. [2019-12-07 13:50:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:50:49,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-07 13:50:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:49,923 INFO L225 Difference]: With dead ends: 7214 [2019-12-07 13:50:49,923 INFO L226 Difference]: Without dead ends: 6455 [2019-12-07 13:50:49,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:50:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-12-07 13:50:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5351. [2019-12-07 13:50:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2019-12-07 13:50:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 14810 transitions. [2019-12-07 13:50:49,987 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 14810 transitions. Word has length 68 [2019-12-07 13:50:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:49,987 INFO L462 AbstractCegarLoop]: Abstraction has 5351 states and 14810 transitions. [2019-12-07 13:50:49,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:50:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 14810 transitions. [2019-12-07 13:50:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:50:49,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:49,990 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, 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 13:50:49,990 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-07 13:50:49,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:49,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955616943] [2019-12-07 13:50:49,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:50,114 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 13:50:50,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955616943] [2019-12-07 13:50:50,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:50,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:50,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328061507] [2019-12-07 13:50:50,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:50:50,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:50:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:50:50,116 INFO L87 Difference]: Start difference. First operand 5351 states and 14810 transitions. Second operand 13 states. [2019-12-07 13:50:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:50,412 INFO L93 Difference]: Finished difference Result 8219 states and 22676 transitions. [2019-12-07 13:50:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:50:50,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-07 13:50:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:50,418 INFO L225 Difference]: With dead ends: 8219 [2019-12-07 13:50:50,419 INFO L226 Difference]: Without dead ends: 7712 [2019-12-07 13:50:50,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:50:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2019-12-07 13:50:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 5640. [2019-12-07 13:50:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2019-12-07 13:50:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 15625 transitions. [2019-12-07 13:50:50,488 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 15625 transitions. Word has length 68 [2019-12-07 13:50:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:50,489 INFO L462 AbstractCegarLoop]: Abstraction has 5640 states and 15625 transitions. [2019-12-07 13:50:50,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:50:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 15625 transitions. [2019-12-07 13:50:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:50:50,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:50,492 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, 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 13:50:50,492 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 3 times [2019-12-07 13:50:50,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:50,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836818677] [2019-12-07 13:50:50,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:50,709 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 13:50:50,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836818677] [2019-12-07 13:50:50,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:50,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:50:50,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127389649] [2019-12-07 13:50:50,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:50:50,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:50:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:50:50,710 INFO L87 Difference]: Start difference. First operand 5640 states and 15625 transitions. Second operand 15 states. [2019-12-07 13:50:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:52,892 INFO L93 Difference]: Finished difference Result 10829 states and 30026 transitions. [2019-12-07 13:50:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 13:50:52,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-07 13:50:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:52,912 INFO L225 Difference]: With dead ends: 10829 [2019-12-07 13:50:52,912 INFO L226 Difference]: Without dead ends: 10364 [2019-12-07 13:50:52,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 13:50:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10364 states. [2019-12-07 13:50:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10364 to 5924. [2019-12-07 13:50:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-12-07 13:50:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 16416 transitions. [2019-12-07 13:50:53,007 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 16416 transitions. Word has length 68 [2019-12-07 13:50:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:53,007 INFO L462 AbstractCegarLoop]: Abstraction has 5924 states and 16416 transitions. [2019-12-07 13:50:53,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:50:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 16416 transitions. [2019-12-07 13:50:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:50:53,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:53,011 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, 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 13:50:53,012 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1379923308, now seen corresponding path program 4 times [2019-12-07 13:50:53,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:53,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862875493] [2019-12-07 13:50:53,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:53,142 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 13:50:53,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862875493] [2019-12-07 13:50:53,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:53,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:50:53,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531208984] [2019-12-07 13:50:53,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:50:53,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:50:53,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:50:53,143 INFO L87 Difference]: Start difference. First operand 5924 states and 16416 transitions. Second operand 13 states. [2019-12-07 13:50:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:53,542 INFO L93 Difference]: Finished difference Result 8288 states and 22707 transitions. [2019-12-07 13:50:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:50:53,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-07 13:50:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:53,549 INFO L225 Difference]: With dead ends: 8288 [2019-12-07 13:50:53,549 INFO L226 Difference]: Without dead ends: 7733 [2019-12-07 13:50:53,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:50:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2019-12-07 13:50:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 5476. [2019-12-07 13:50:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2019-12-07 13:50:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 15095 transitions. [2019-12-07 13:50:53,620 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 15095 transitions. Word has length 68 [2019-12-07 13:50:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:53,620 INFO L462 AbstractCegarLoop]: Abstraction has 5476 states and 15095 transitions. [2019-12-07 13:50:53,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:50:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 15095 transitions. [2019-12-07 13:50:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:50:53,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:53,623 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, 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 13:50:53,624 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 5 times [2019-12-07 13:50:53,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:53,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770110654] [2019-12-07 13:50:53,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:50:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:50:53,688 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:50:53,688 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:50:53,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1967~0.base_23| 4)) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23|)) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23| 1)) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23|) |v_ULTIMATE.start_main_~#t1967~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd2~0_100 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_23|) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_21|, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_23|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:50:53,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-07 13:50:53,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 0)) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_97 256))) (not (= (mod v_~z$w_buff0_used~0_206 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_206 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:50:53,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:50:53,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1693755387 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1693755387 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1693755387| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1693755387| ~z$w_buff0_used~0_In-1693755387)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1693755387} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1693755387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1693755387} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:50:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-955840681 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-955840681 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-955840681 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-955840681 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-955840681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-955840681 |P0Thread1of1ForFork0_#t~ite6_Out-955840681|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-955840681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-955840681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-955840681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-955840681} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-955840681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-955840681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-955840681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-955840681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-955840681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:50:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In-1748848408 ~z$r_buff0_thd1~0_Out-1748848408)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1748848408 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1748848408 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out-1748848408 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1748848408} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1748848408|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1748848408} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:50:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1328065588 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1328065588 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1328065588 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1328065588 256)))) (or (and (= ~z$r_buff1_thd1~0_In1328065588 |P0Thread1of1ForFork0_#t~ite8_Out1328065588|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1328065588|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1328065588, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1328065588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328065588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1328065588} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1328065588, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1328065588|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1328065588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328065588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1328065588} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:50:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:50:53,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1488748305 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1488748305 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1488748305| ~z~0_In-1488748305)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1488748305| ~z$w_buff1~0_In-1488748305)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1488748305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488748305, ~z$w_buff1~0=~z$w_buff1~0_In-1488748305, ~z~0=~z~0_In-1488748305} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1488748305|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1488748305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488748305, ~z$w_buff1~0=~z$w_buff1~0_In-1488748305, ~z~0=~z~0_In-1488748305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 13:50:53,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_19|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 13:50:53,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In464611352 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In464611352 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out464611352| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out464611352| ~z$w_buff0_used~0_In464611352) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In464611352, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In464611352} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In464611352, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out464611352|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In464611352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:50:53,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1949985393 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1949985393 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1949985393| ~z~0_In-1949985393) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1949985393| ~z$w_buff1~0_In-1949985393) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949985393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949985393, ~z$w_buff1~0=~z$w_buff1~0_In-1949985393, ~z~0=~z~0_In-1949985393} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1949985393|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949985393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949985393, ~z$w_buff1~0=~z$w_buff1~0_In-1949985393, ~z~0=~z~0_In-1949985393} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:50:53,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2132199231 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2132199231 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-2132199231 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2132199231 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2132199231|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2132199231 |P1Thread1of1ForFork1_#t~ite12_Out-2132199231|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132199231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2132199231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132199231, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132199231} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132199231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2132199231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132199231, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2132199231|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132199231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:50:53,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1179881601 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1179881601 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1179881601|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1179881601 |P1Thread1of1ForFork1_#t~ite13_Out1179881601|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179881601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1179881601|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179881601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:50:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_45) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 13:50:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In320321837 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In320321837 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out320321837| ~z$w_buff0_used~0_In320321837) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out320321837| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In320321837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320321837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In320321837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320321837, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out320321837|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 13:50:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1155815033 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1155815033 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1155815033 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1155815033 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1155815033 |P2Thread1of1ForFork2_#t~ite18_Out1155815033|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1155815033|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1155815033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1155815033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1155815033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1155815033} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1155815033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1155815033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1155815033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1155815033, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1155815033|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 13:50:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In388181351 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In388181351 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out388181351| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out388181351| ~z$r_buff0_thd3~0_In388181351) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388181351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388181351} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In388181351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388181351, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out388181351|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1207591099 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1207591099 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1207591099 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1207591099 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1207591099| ~z$r_buff1_thd3~0_In-1207591099) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1207591099| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207591099, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1207591099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1207591099, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1207591099} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207591099, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1207591099|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1207591099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1207591099, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1207591099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_66) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In655148143 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In655148143 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In655148143 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In655148143 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out655148143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out655148143| ~z$r_buff1_thd2~0_In655148143) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In655148143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In655148143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655148143, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655148143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In655148143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In655148143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655148143, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out655148143|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655148143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In7414068 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In7414068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out7414068| ~z$w_buff1~0_In7414068) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite24_Out7414068| ~z~0_In7414068) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In7414068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7414068, ~z$w_buff1~0=~z$w_buff1~0_In7414068, ~z~0=~z~0_In7414068} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In7414068, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out7414068|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7414068, ~z$w_buff1~0=~z$w_buff1~0_In7414068, ~z~0=~z~0_In7414068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 13:50:53,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-07 13:50:53,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1483846188 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1483846188 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1483846188 |ULTIMATE.start_main_#t~ite26_Out-1483846188|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1483846188| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1483846188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1483846188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1483846188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 13:50:53,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2078668159 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2078668159 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2078668159 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2078668159 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-2078668159| ~z$w_buff1_used~0_In-2078668159)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-2078668159| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2078668159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078668159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2078668159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078668159} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2078668159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078668159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2078668159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078668159, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2078668159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 13:50:53,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In95073997 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In95073997 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In95073997 |ULTIMATE.start_main_#t~ite28_Out95073997|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out95073997|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In95073997, ~z$w_buff0_used~0=~z$w_buff0_used~0_In95073997} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In95073997, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out95073997|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In95073997} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 13:50:53,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1100213473 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1100213473 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1100213473 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1100213473 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out1100213473| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out1100213473| ~z$r_buff1_thd0~0_In1100213473) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1100213473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1100213473, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1100213473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1100213473} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1100213473, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1100213473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1100213473, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1100213473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1100213473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 13:50:53,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:50:53,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:50:53,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:50:53,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:50:53 BasicIcfg [2019-12-07 13:50:53,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:50:53,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:50:53,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:50:53,760 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:50:53,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:48:38" (3/4) ... [2019-12-07 13:50:53,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:50:53,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1967~0.base_23| 4)) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23|)) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23| 1)) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23|) |v_ULTIMATE.start_main_~#t1967~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd2~0_100 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_23|) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_21|, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_23|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:50:53,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-07 13:50:53,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 0)) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_97 256))) (not (= (mod v_~z$w_buff0_used~0_206 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_206 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:50:53,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:50:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1693755387 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1693755387 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1693755387| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1693755387| ~z$w_buff0_used~0_In-1693755387)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1693755387} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1693755387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1693755387} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:50:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-955840681 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-955840681 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-955840681 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-955840681 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-955840681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-955840681 |P0Thread1of1ForFork0_#t~ite6_Out-955840681|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-955840681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-955840681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-955840681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-955840681} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-955840681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-955840681, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-955840681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-955840681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-955840681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:50:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In-1748848408 ~z$r_buff0_thd1~0_Out-1748848408)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1748848408 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1748848408 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out-1748848408 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1748848408} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1748848408|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1748848408} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:50:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1328065588 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1328065588 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1328065588 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1328065588 256)))) (or (and (= ~z$r_buff1_thd1~0_In1328065588 |P0Thread1of1ForFork0_#t~ite8_Out1328065588|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1328065588|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1328065588, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1328065588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328065588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1328065588} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1328065588, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1328065588|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1328065588, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328065588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1328065588} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:50:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:50:53,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1488748305 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1488748305 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1488748305| ~z~0_In-1488748305)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1488748305| ~z$w_buff1~0_In-1488748305)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1488748305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488748305, ~z$w_buff1~0=~z$w_buff1~0_In-1488748305, ~z~0=~z~0_In-1488748305} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1488748305|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1488748305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488748305, ~z$w_buff1~0=~z$w_buff1~0_In-1488748305, ~z~0=~z~0_In-1488748305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 13:50:53,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_19|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 13:50:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In464611352 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In464611352 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out464611352| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out464611352| ~z$w_buff0_used~0_In464611352) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In464611352, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In464611352} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In464611352, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out464611352|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In464611352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:50:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1949985393 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1949985393 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1949985393| ~z~0_In-1949985393) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1949985393| ~z$w_buff1~0_In-1949985393) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949985393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949985393, ~z$w_buff1~0=~z$w_buff1~0_In-1949985393, ~z~0=~z~0_In-1949985393} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1949985393|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949985393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949985393, ~z$w_buff1~0=~z$w_buff1~0_In-1949985393, ~z~0=~z~0_In-1949985393} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:50:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2132199231 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2132199231 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-2132199231 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2132199231 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2132199231|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2132199231 |P1Thread1of1ForFork1_#t~ite12_Out-2132199231|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132199231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2132199231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132199231, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132199231} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132199231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2132199231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132199231, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2132199231|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132199231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:50:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1179881601 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1179881601 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1179881601|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1179881601 |P1Thread1of1ForFork1_#t~ite13_Out1179881601|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179881601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1179881601|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179881601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:50:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_45) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 13:50:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In320321837 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In320321837 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out320321837| ~z$w_buff0_used~0_In320321837) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out320321837| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In320321837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320321837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In320321837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320321837, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out320321837|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 13:50:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1155815033 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1155815033 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1155815033 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1155815033 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1155815033 |P2Thread1of1ForFork2_#t~ite18_Out1155815033|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1155815033|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1155815033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1155815033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1155815033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1155815033} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1155815033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1155815033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1155815033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1155815033, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1155815033|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 13:50:53,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In388181351 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In388181351 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out388181351| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out388181351| ~z$r_buff0_thd3~0_In388181351) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388181351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388181351} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In388181351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388181351, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out388181351|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1207591099 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1207591099 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1207591099 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1207591099 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1207591099| ~z$r_buff1_thd3~0_In-1207591099) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1207591099| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207591099, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1207591099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1207591099, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1207591099} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207591099, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1207591099|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1207591099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1207591099, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1207591099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_66) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In655148143 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In655148143 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In655148143 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In655148143 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out655148143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out655148143| ~z$r_buff1_thd2~0_In655148143) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In655148143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In655148143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655148143, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655148143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In655148143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In655148143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655148143, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out655148143|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655148143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In7414068 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In7414068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out7414068| ~z$w_buff1~0_In7414068) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite24_Out7414068| ~z~0_In7414068) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In7414068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7414068, ~z$w_buff1~0=~z$w_buff1~0_In7414068, ~z~0=~z~0_In7414068} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In7414068, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out7414068|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In7414068, ~z$w_buff1~0=~z$w_buff1~0_In7414068, ~z~0=~z~0_In7414068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 13:50:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-07 13:50:53,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1483846188 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1483846188 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1483846188 |ULTIMATE.start_main_#t~ite26_Out-1483846188|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1483846188| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1483846188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1483846188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1483846188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 13:50:53,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2078668159 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2078668159 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2078668159 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2078668159 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-2078668159| ~z$w_buff1_used~0_In-2078668159)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-2078668159| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2078668159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078668159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2078668159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078668159} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2078668159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078668159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2078668159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078668159, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2078668159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 13:50:53,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In95073997 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In95073997 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In95073997 |ULTIMATE.start_main_#t~ite28_Out95073997|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out95073997|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In95073997, ~z$w_buff0_used~0=~z$w_buff0_used~0_In95073997} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In95073997, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out95073997|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In95073997} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 13:50:53,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1100213473 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1100213473 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1100213473 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1100213473 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out1100213473| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out1100213473| ~z$r_buff1_thd0~0_In1100213473) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1100213473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1100213473, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1100213473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1100213473} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1100213473, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1100213473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1100213473, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1100213473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1100213473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 13:50:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:50:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:50:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:50:53,831 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1892cfaf-dade-4f9d-a11e-34f25f025bc6/bin/utaipan/witness.graphml [2019-12-07 13:50:53,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:50:53,832 INFO L168 Benchmark]: Toolchain (without parser) took 136327.31 ms. Allocated memory was 1.0 GB in the beginning and 8.7 GB in the end (delta: 7.6 GB). Free memory was 943.5 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 13:50:53,833 INFO L168 Benchmark]: CDTParser took 0.13 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 13:50:53,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:53,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.71 ms. Allocated memory is still 1.1 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 13:50:53,833 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:50:53,834 INFO L168 Benchmark]: RCFGBuilder took 404.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:53,834 INFO L168 Benchmark]: TraceAbstraction took 135391.43 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.5 GB). Free memory was 998.8 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 13:50:53,834 INFO L168 Benchmark]: Witness Printer took 71.46 ms. Allocated memory is still 8.7 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:53,836 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.13 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 391.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.71 ms. Allocated memory is still 1.1 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 25.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 404.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135391.43 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.5 GB). Free memory was 998.8 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 71.46 ms. Allocated memory is still 8.7 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4866 SDtfs, 5770 SDslu, 14823 SDs, 0 SdLazy, 9584 SolverSat, 410 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 56 SyntacticMatches, 25 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245714occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 87.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 485095 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1210 ConstructedInterpolants, 0 QuantifiedInterpolants, 362696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...